Automata, Languages and Programming

DOI10.1007/b99859zbMath1099.68773OpenAlexW2505584480MaRDI QIDQ5466542

Peter Sanders, Naveen Sivadasan

Publication date: 24 August 2005

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (6)

Online removable square packing ⋮ Online scheduling with reassignment ⋮ Station assignment with reallocation ⋮ Semi-online scheduling with ``end of sequence information ⋮ A robust APTAS for the classical bin packing problem ⋮ Online scheduling on two uniform machines to minimize the makespan

This page was built for publication: Automata, Languages and Programming