Tomás Ebenlendr, Jiri Sgall. A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption. In Roberto Solis-Oba, Giuseppe Persiano, editors, Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Volume 7164 of Lecture Notes in Computer Science, pages 102-108, Springer, 2011. [doi]
@inproceedings{EbenlendrS11-0,
title = {A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption},
author = {Tomás Ebenlendr and Jiri Sgall},
year = {2011},
doi = {10.1007/978-3-642-29116-6_9},
url = {http://dx.doi.org/10.1007/978-3-642-29116-6_9},
researchr = {https://researchr.org/publication/EbenlendrS11-0},
cites = {0},
citedby = {0},
pages = {102-108},
booktitle = {Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers},
editor = {Roberto Solis-Oba and Giuseppe Persiano},
volume = {7164},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-29115-9},
}