New Bounds for Multidimensional Packing

New upper and lower bounds are presented for a multidimensional generalization of bin packing called box packing. Several variants of this problem, including bounded space box packing, square packing, variable-sized box packing and resource augmented box packing are also studied. The main results, stated for d=2 , are as follows: a new upper bound of 2.66013 for online box packing, a new 14/9 + ɛ polynomial time offline approximation algorithm for square packing, a new upper bound of 2.43828 for online square packing, a new lower bound of 1.62176 for online square packing, a new lower bound of 2.28229 for bounded space online square packing and a new upper bound of 2.32571 for online two-sized box packing.

[1]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  János Csirik,et al.  An on-line algorithm for multidimensional bin packing , 1993, Oper. Res. Lett..

[3]  Donna J. Brown,et al.  A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms. , 1979 .

[4]  Steven S. Seiden.  On the Online Bin Packing Problem , 2001, ICALP.

[5]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[6]  D. T. Lee,et al.  On-Line Bin Packing in Linear Time , 1989, J. Algorithms.

[7]  Gerhard J. Woeginger,et al.  Resource augmentation for online bounded space bin packing , 2000, J. Algorithms.

[8]  Satoshi Fujita,et al.  Two-dimensional on-line bin packing problem with rotatable items , 2002, Theor. Comput. Sci..

[9]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[10]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[11]  L. Moser,et al.  On packing of squares and cubes , 1968 .

[12]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[13]  J. B. G. Frenk,et al.  Two-Dimensional Rectangle Packing: On-Line Methods and Results , 1993, Discret. Appl. Math..

[14]  Michael B. Richey,et al.  Improved bounds for harmonic-based bin packing algorithms , 1991, Discret. Appl. Math..

[15]  Steven S. Seiden,et al.  An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing , 2000, SIAM J. Discret. Math..

[16]  Gerhard J. Woeginger,et al.  On-line Packing and Covering Problems , 1996, Online Algorithms.

[17]  Yoshiharu Kohayakawa,et al.  Multidimensional Cube Packing , 2001, Algorithmica.

[18]  János Csirik.  An on-line algorithm for variable-sized bin packing , 2004, Acta Informatica.

[19]  D. S. Johnson,et al.  On Packing Two-Dimensional Bins , 1982 .

[20]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[21]  Joseph Y.-T. Leung,et al.  Packing Squares into a Square , 1990, J. Parallel Distributed Comput..