A note on online hypercube packing
From MaRDI portal
Publication:623793
DOI10.1007/s10100-009-0109-zzbMath1204.90082MaRDI QIDQ623793
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
online algorithms; competitive ratio; approximation algorithms; harmonic algorithm; hypercube packing
90C27: Combinatorial optimization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68W27: Online algorithms; streaming algorithms
Related Items
Two-dimensional online bin packing with rotation, Constructive heuristics for the canister filling problem
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
