Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing

DOI10.1007/978-3-642-21204-8_33zbMath1329.68302OpenAlexW17417972MaRDI QIDQ3004684

Xin Han, Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_33

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• On-line grid-packing with a single active grid
• A 71/60 theorem for bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• An improved lower bound for on-line bin packing algorithms
• Two-dimensional rectangle packing: On-line methods and results
• New bounds for multidimensional packing
• Improved Online Algorithms for 1-Space Bounded 2-Dimensional 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
• 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
• Bounded space on-line bin packing: Best is better than first