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. Approximation and Online Algorithms. 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 …)


  This site uses cookies to make them easier to browse. Learn more about how we use cookies.