Request file

Review/Citation:  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. emApproximation and Online Algorithms/em. Heidelberg: Springer, 2012, s. 102-108. Lecture Notes in Computer Science, 7164. ISBN 978-3-642-29115-9

Requested document:  Ebenlendr.pdf - Publisher’s postprint

The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.

Fields marked with * are obligatory.

(Universities, research institutions, associations …)

Here. *