Algorithms and Computation

DOI10.1007/b94771zbMath1205.90120OpenAlexW1769833081MaRDI QIDQ5191690

Aris Pagourtzis, Peter Widmayer, Stephan J. Eidenbenz

Publication date: 7 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94771

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Online machine minimization with lookahead ⋮ Scheduling with a minimum number of machines

This page was built for publication: Algorithms and Computation