Online algorithms for 1-space bounded 2-dimensional bin packing and square packing

DOI10.1016/j.tcs.2014.02.045zbMath1360.68911OpenAlexW2061918649MaRDI QIDQ744097

Hing-Fung Ting, Deshi Ye, Yong Zhang, Chung Keung Poon, Xin Han, Francis Y. L. Chin, Yung Hyang Tsin

Publication date: 6 October 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.045

zbMATH Keywords

competitive analysistwo-dimensional bin packingsquare packing

Mathematics Subject Classification ID

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

Related Items (5)

Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing ⋮ An asymptotic competitive scheme for online bin packing ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ A note on one-space bounded square packing

Cites Work

• Unnamed Item
• On-line grid-packing with a single active grid
• An improved lower bound for on-line bin packing algorithms
• On-line packing sequences of cubes in the unit cube
• Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing
• Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
• A new upper bound 2.5545 on 2D Online Bin Packing
• On the online bin packing problem
• 1-Bounded Space Algorithms for 2-Dimensional Bin Packing
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Optimal Online Algorithms for Multidimensional Packing Problems
• Bounded space on-line bin packing: Best is better than first

This page was built for publication: Online algorithms for 1-space bounded 2-dimensional bin packing and square packing