Number of the records: 1  

A lower bound on deterministic online algorithms for scheduling on related machines without preemption

  1. 1.
    SYSNO0386905
    TitleA lower bound on deterministic online algorithms for scheduling on related machines without preemption
    Author(s) Ebenlendr, Tomáš (MU-W) SAI, RID
    Sgall, J. (CZ)
    Source Title Approximation and Online Algorithms. S. 102-108. - Heidelberg : Springer, 2012 / Solis-Oba R. ; Persiano G.
    Conference 9th International Workshop, WAOA 2011, Saarbrücken, 08.09.2011-09.09.2011
    Document TypeKonferenční příspěvek (zahraniční konf.)
    Grant IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    1M0545 GA MŠk - Ministry of Education, Youth and Sports (MEYS), CZ - Česká republika
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountryDE
    Keywords algorithm analysis * problem complexity * computer science
    URLhttp://link.springer.com/chapter/10.1007%2F978-3-642-29116-6_9
    Permanent Linkhttp://hdl.handle.net/11104/0219394
    FileDownloadSizeCommentaryVersionAccess
    Ebenlendr.pdf2168.5 KBPublisher’s postprintrequire
     
Number of the records: 1