On-line algorithms for 2-space bounded 2-dimensional bin packing
From MaRDI portal
Publication:456101
DOI10.1016/j.ipl.2012.06.016zbMath1248.68572OpenAlexW1979728490MaRDI QIDQ456101
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.016
Related Items
Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing ⋮ A note on one-space bounded square packing
Cites Work
- Online removable square packing
- On-line grid-packing with a single active grid
- On-line packing sequences of cubes in the unit cube
- Packing rectangles into the unit square
- Online square and cube packing
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- On-line Packing Squares into n Unit Squares
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING
- On Packing Two-Dimensional Bins
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Bounded space on-line bin packing: Best is better than first