Počet záznamů: 1  

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

  1. 1.
    Ebenlendr, Tomáš - Sgall, J.
    A lower bound on deterministic online algorithms for scheduling on related machines without preemption.
    Approximation and Online Algorithms. Heidelberg: Springer, 2012 - (Solis-Oba, R.; Persiano, G.), s. 102-108. Lecture Notes in Computer Science, 7164. ISBN 978-3-642-29115-9.
    [9th International Workshop, WAOA 2011. Saarbrücken (DE), 08.09.2011-09.09.2011]
    http://link.springer.com/chapter/10.1007%2F978-3-642-29116-6_9
    http://hdl.handle.net/11104/0219394
Počet záznamů: 1