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. In: SOLIS-OBA, R., PERSIANO, G., eds. Approximation and Online Algorithms. Heidelberg: Springer, 2012, s. 102-108. Lecture Notes in Computer Science, 7164. ISBN 978-3-642-29115-9. Dostupné z: doi: 10.1007/978-3-642-29116-6_9.
Počet záznamů: 1