1-bounded space algorithms for 2-dimensional bin packing

DOI10.1007/978-3-642-10631-6_34MaRDI QIDQ3652220zbMATH OpenOpenAlexFDO

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

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_34

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• One-space bounded algorithms for two-dimensional bin packing
• Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin 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
• On-line algorithms for 2-space bounded 2-dimensional bin packing

Cited in

(8)

• A framework for 1-D compaction with forbidden region avoidance
• Efficient 1-space bounded hypercube packing algorithm
• Online algorithm for 1-space bounded multi-dimensional bin packing
• One-space bounded algorithms for two-dimensional bin packing
• Two-bounded-space bin packing revisited
• On-line algorithms for 2-space bounded 2-dimensional bin 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

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

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