Approximation algorithms for extensible bin packing

DOI10.1007/s10951-006-5594-5zbMath1154.90432OpenAlexW3137214896MaRDI QIDQ880529

George S. Lueker, Edward G. jun. Coffman

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-5594-5

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Online bin packing with overload cost ⋮ Approximation schemes for the generalized extensible bin packing problem ⋮ Maximizing data locality in distributed systems ⋮ Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers ⋮ Structure of polynomial-time approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 13/12 approximation algorithm for bin packing with extendable bins
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• Approximation schemes for scheduling on parallel machines
• An Efficient Approximation Scheme for Variable-Sized Bin Packing

This page was built for publication: Approximation algorithms for extensible bin packing