ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING

DOI10.1142/S0129054110007611zbMath1206.68371MaRDI QIDQ3069730

Yong Zhang, Hing-Fung Ting, Francis Y. L. Chin

Publication date: 19 January 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

competitive analysisonline algorithmsbin packingbounded space

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ On-line algorithms for 2-space bounded 2-dimensional bin packing ⋮ A note on one-space bounded square packing

Cites Work

• Online removable square packing
• An improved lower bound for on-line bin packing algorithms
• On-line packing sequences of cubes in the unit cube
• Multidimensional cube packing
• Online square and cube packing
• On the online bin packing problem
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing
• On Packing Two-Dimensional Bins
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• On-line bin packing in linear time
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Optimal Online Algorithms for Multidimensional Packing Problems
• On packing of squares and cubes
• Bounded space on-line bin packing: Best is better than first

This page was built for publication: ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING