Basket

0440693 - MÚ 2015 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Sgall, J.
A lower bound on deterministic online algorithms for scheduling on related machines without preemption.
Theory of Computing Systems. Roč. 56, č. 1 (2015), s. 73-81. ISSN 1432-4350. E-ISSN 1433-0490
R&D Projects: GA ČR GBP202/12/G061; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : online algorithms * scheduling * makespan
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.719, year: 2015
http://link.springer.com/article/10.1007%2Fs00224-013-9451-6
Permanent Link: http://hdl.handle.net/11104/0243792