Two-Bounded-Space Bin Packing Revisited

DOI10.1007/978-3-642-23719-5_23zbMath1346.68254OpenAlexW1532428783MaRDI QIDQ3092235

Gerhard J. Woeginger, Jiří Sgall, Marek Chrobak

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_23

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Online Colored Bin Packing ⋮ A 4-space bounded approximation algorithm for online bin packing problem ⋮ Colored bin packing: online algorithms and lower bounds ⋮ Online dominating set ⋮ More on ordered open end bin packing ⋮ Comparing the costs of any fit algorithms for bin packing

This page was built for publication: Two-Bounded-Space Bin Packing Revisited