Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling

DOI10.1145/1109557.1109595zbMath1192.90065OpenAlexW4245356544WikidataQ58062994 ScholiaQ58062994MaRDI QIDQ3581493

Kin-Shing Liu, Ho-Leung Chan, Tak-Wah Lam

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10722/53611

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

This page was built for publication: Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling