Bounds for online bounded space hypercube packing

DOI10.1016/j.disopt.2006.11.005zbMath1163.90603OpenAlexW2081797760WikidataQ105583599 ScholiaQ105583599MaRDI QIDQ2467129

Rob van Stee, Leah Epstein

Publication date: 18 January 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/11032

zbMATH Keywords

online algorithmsbin packingbounded space

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items

Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A note on online hypercube packing ⋮ Prices of Anarchy of Selfish 2D Bin Packing Games ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Online square-into-square packing ⋮ Online bin packing of squares and cubes ⋮ Two-dimensional online bin packing with rotation ⋮ A bounded space algorithm for online circle packing ⋮ A tight lower bound for the online bounded space hypercube bin packing problem ⋮ A note on one-space bounded square packing

Cites Work

• An on-line algorithm for multidimensional bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Two-dimensional rectangle packing: On-line methods and results
• New bounds for multidimensional packing
• Cube packing.
• Fast algorithms for bin packing
• A simple on-line bin-packing algorithm
• Optimal Online Algorithms for Multidimensional Packing Problems

This page was built for publication: Bounds for online bounded space hypercube packing