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

0386905 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
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]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : algorithm analysis * problem complexity * computer science
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-29116-6_9
Permanent Link: http://hdl.handle.net/11104/0219394