A tight lower bound for the online bounded space hypercube bin packing problem

DOI10.46298/dmtcs.8325zbMath1489.05117arXiv2107.14161OpenAlexW3200360716WikidataQ105468677 ScholiaQ105468677MaRDI QIDQ5024670

Flávio K. Miyazawa, Yoshiharu Kohayakawa, Yoshiko Wakabayashi

Publication date: 27 January 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.14161

zbMATH Keywords

hypercube packingonline bin packingasymptotic performance ratioonline bounded space packing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• New lower bounds for certain classes of bin packing algorithms
• An on-line algorithm for multidimensional bin packing
• An improved lower bound for on-line bin packing algorithms
• A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
• Approximation and online algorithms for multidimensional bin packing: a survey
• Bounds for online bounded space hypercube packing
• On the online bin packing problem
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing
• Beating the Harmonic Lower Bound for Online Bin Packing
• Optimal Online Algorithms for Multidimensional Packing Problems
• Lower bounds for several online variants of bin packing

This page was built for publication: A tight lower bound for the online bounded space hypercube bin packing problem