Online square and cube packing
From MaRDI portal
Publication:2570973
DOI10.1007/S00236-005-0169-ZzbMath1079.68115OpenAlexW2157063282MaRDI QIDQ2570973
Publication date: 31 October 2005
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-005-0169-z
Related Items (18)
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Packing Cubes into a Cube in (D>3)-Dimensions ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Dynamic multi-dimensional bin packing ⋮ A note on online hypercube packing ⋮ On-line algorithms for 2-space bounded 2-dimensional bin packing ⋮ Online removable square packing ⋮ Online square packing with gravity ⋮ Online bin packing of squares and cubes ⋮ Online square-into-square packing ⋮ 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 ⋮ Lower bounds for several online variants of bin packing ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ A lower bound for online rectangle packing ⋮ Packing cubes into a cube is NP-complete in the strong sense
Cites Work
- Unnamed Item
- 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.
- Fast algorithms for bin 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
- Algorithms – ESA 2004
- Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
This page was built for publication: Online square and cube packing
