Approximation and Online Algorithms
From MaRDI portal
Publication:5898467
DOI10.1007/11671411zbMath1125.68430OpenAlexW4210634114MaRDI QIDQ5898467
John Noga, Tomáš Ebenlendr, Gerhard J. Woeginger, Jiří Sgall
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
Improved approaches to the exact solution of the machine covering problem ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Machine covering in the random-order model ⋮ Online scheduling with rejection and reordering: exact algorithms for unit size jobs ⋮ Machine covering with combined partial information ⋮ The cost of selfishness for maximizing the minimum load on uniformly related machines
This page was built for publication: Approximation and Online Algorithms
