A note on online hypercube packing

DOI10.1007/S10100-009-0109-ZzbMath1204.90082OpenAlexW2016388001MaRDI QIDQ623793

Sumit K. Garg

Publication date: 8 February 2011

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-009-0109-z

zbMATH Keywords

online algorithmscompetitive ratioapproximation algorithmsharmonic algorithmhypercube packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Online algorithms; streaming algorithms (68W27)

Related Items (9)

Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Online circle and sphere packing ⋮ Online bin packing of squares and cubes ⋮ Online bin packing of squares and cubes ⋮ A new upper bound for the online square packing problem in a strip ⋮ Two-dimensional online bin packing with rotation ⋮ Constructive heuristics for the canister filling problem ⋮ Lower bounds for several online variants of bin packing ⋮ A lower bound for online rectangle packing

Cites Work

• An on-line algorithm for multidimensional bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• A lower bound for on-line bin packing
• An improved lower bound for on-line bin packing algorithms
• New bounds for multidimensional packing
• Cube packing.
• Bounds for online bounded space hypercube packing
• Online square and cube packing
• On the online bin packing problem
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• On-line bin packing in linear time
• Optimal Online Algorithms for Multidimensional Packing Problems

This page was built for publication: A note on online hypercube packing