New Lower Bounds for Certain Classes of Bin Packing Algorithms
From MaRDI portal
Publication:3075446
DOI10.1007/978-3-642-18318-8_3zbMath1314.68141OpenAlexW2175514457WikidataQ105609284 ScholiaQ105609284MaRDI QIDQ3075446
János Balogh, Gábor Galambos, József Békési
Publication date: 15 February 2011
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18318-8_3
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Related Items (7)
An asymptotic competitive scheme for online bin packing ⋮ On-line bin packing with restricted repacking ⋮ Online square packing with gravity ⋮ Station assignment with reallocation ⋮ Fully dynamic bin packing revisited ⋮ NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation ⋮ NF-based algorithms for online bin packing with buffer and bounded item size
This page was built for publication: New Lower Bounds for Certain Classes of Bin Packing Algorithms
