2-space bounded online cube and hypercube packing

DOI10.1109/TST.2015.7128937MaRDI QIDQ3461308zbMATH OpenFDO

Authors Xiaofan Zhao, Hong Shen

Publication date 15 January 2016

Published in Tsinghua Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TST.2015.7128937

zbMATH Keywords

asymptotic competitive ratiohypercube packingonline algorithm

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
• Bounds for online bounded space hypercube packing
• Improved Online Hypercube Packing
• Efficient 1-space bounded hypercube packing algorithm

Cited in

(12)

• Multidimensional cube packing
• Online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing
• A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
• Drawer algorithms for 1-space bounded multidimensional hyperbox packing
• Bounds for online bounded space hypercube packing
• Online square and cube packing
• Multidimensional cube packing
• Efficient online packing of 4-dimensional cubes into the unit cube
• A tight lower bound for the online bounded space hypercube bin packing problem
• Improved Online Hypercube Packing
• A note on online hypercube packing

This page was built for publication: 2-space bounded online cube and hypercube packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461308)