Improved Online Hypercube Packing

DOI10.1007/11970125_18MaRDI QIDQ5443522zbMATH OpenOpenAlexFDO

Authors

Publication date 21 February 2008

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11970125_18

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• A note on online hypercube packing
• Online square and cube packing
• 2-space bounded online cube and hypercube packing
• Bounds for online bounded space hypercube packing
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing

Cited in

(9)

• Efficient 1-space bounded hypercube packing algorithm
• Bounds for online bounded space hypercube packing
• Online square and cube packing
• 2-space bounded online cube and hypercube packing
• Online bin packing of squares and cubes
• Online bin packing of squares and cubes
• Dynamic multi-dimensional bin packing
• A note on online hypercube packing
• Upper bound for the approximation ratio of a class of hypercube segmentation algorithms

This page was built for publication: Improved Online Hypercube Packing

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