Two-dimensional bin packing with one-dimensional resource augmentation

The two-dimensional bin packing problem is a generalization of the classical bin packing problem and is defined as follows. Given a collection of rectangles specified by their width and height, pack these into a minimum number of square bins of unit size. Recently, the problem was proved to be APX-hard even in the asymptotic case, i.e. when the optimum solutions require a large number of bins [N. Bansal, J. Correa, C. Kenyon, M. Sviridenko, Bin packing in multiple dimensions: Inapproximability results and approximation schemes, Math. Oper. Res. 31 (1) (2006) 31-49]. On the positive side, there exists a polynomial time algorithm that uses OPT bins whose sides have length ([email protected]), where OPT denotes the number of unit sized bins used by the optimum solution [N. Bansal, J. Correa, C. Kenyon, M. Sviridenko, Bin packing in multiple dimensions: Inapproximability results and approximation schemes, Math. Oper. Res. 31 (1) (2006) 31-49]. A natural question that remains is the approximability of the problem when we are allowed to relax the size of the unit bins in only one dimension. In this paper, we show that there exists an asymptotic polynomial time approximation scheme for packing rectangles into bins of size 1x([email protected]).

[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]  Gerhard J. Woeginger,et al.  On-line Packing and Covering Problems , 1996, Online Algorithms.

[3]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[4]  Carlos Eduardo Ferreira,et al.  Packing Squares into Squares , 1999 .

[5]  Claire Mathieu,et al.  A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem , 2000, Math. Oper. Res..

[6]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[7]  Andrea Lodi,et al.  A tale of two dimensional bin packing , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[8]  Mihalis Yannakakis,et al.  Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings , 2000, SIAM J. Discret. Math..

[9]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

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

[11]  José R. Correa,et al.  Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes , 2006, Math. Oper. Res..

[12]  Alberto Caprara,et al.  Packing 2-dimensional bins in harmony , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

[14]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[15]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .