|
|||||
|
|
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption |
|
| Authors: | Tomáš Ebenlendr Jiří Sgall |
| Affiliation: | 1. Institute of Mathematics, AS CR, ?itná 25, 11567, Praha 1, Czech Republic 2. Faculty of Mathematics and Physics, Computer Science Inst. of Charles University, Malostranské nám. 25, 11800, Praha 1, Czech Republic |
| Abstract: | |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |