Online algorithm for 1-space bounded multi-dimensional bin packing

DOI10.1007/978-3-642-21204-8_33MaRDI QIDQ3004684zbMATH OpenOpenAlexFDO

Authors Yong Zhang, Xin Han, 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

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

Recommendations

• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
• Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
• Drawer algorithms for 1-space bounded multidimensional hyperbox packing

Cites work

• 1-bounded space algorithms for 2-dimensional bin packing
• A 71/60 theorem for bin packing
• A simple on-line bin-packing algorithm
• An improved lower bound for on-line bin packing algorithms
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Bounded space on-line bin packing: Best is better than first
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 563208 (Why is no real title available?)
• Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• New Algorithms for Bin Packing
• New bounds for multidimensional packing
• On Packing Two-Dimensional Bins
• On the online bin packing problem
• On-line bin packing in linear time
• On-line grid-packing with a single active grid
• Optimal Online Algorithms for Multidimensional Packing Problems
• Two-dimensional rectangle packing: On-line methods and results
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(10)

• Online algorithms for a dual version of bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Online algorithms with advice for the dual bin packing problem
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
• Drawer algorithms for 1-space bounded multidimensional hyperbox packing
• Online Bin Packing with (1,1) and (2,R) Bins
• Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
• Optimal online bounded space multidimensional packing
• A 4-space bounded approximation algorithm for online bin packing problem
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing

This page was built for publication: Online algorithm for 1-space bounded multi-dimensional bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004684)