A 3-approximation algorithm for two-dimensional bin packing

In the classical two-dimensional bin packing problem one is asked to pack a set of rectangular items, without overlap and without any rotation, into the minimum number of identical square bins. We give an approximation algorithm with absolute worst-case ratio of 3.

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

[2]  Rob van Stee,et al.  New bounds for multi-dimensional packing , 2002, SODA '02.

[3]  Nikhil Bansal,et al.  New approximability and inapproximability results for 2-dimensional Bin Packing , 2004, SODA '04.

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

[5]  Jan Karel Lenstra,et al.  Computing near-optimal schedules , 1995 .

[6]  José R. Correa,et al.  Approximation schemes for multidimensional packing , 2004, SODA '04.

[7]  Klaus Jansen,et al.  On rectangle packing: maximizing benefits , 2004, SODA '04.

[8]  Chak-Kuen Wong,et al.  Linear time-approximation algorithms for bin packing , 2000, Oper. Res. Lett..

[9]  A. Steinberg,et al.  A Strip-Packing Algorithm with Absolute Performance Bound 2 , 1997, SIAM J. Comput..

[10]  Daniele Vigo,et al.  Recent advances on two-dimensional bin packing problems , 2002, Discret. Appl. Math..

[11]  Yoshiharu Kohayakawa,et al.  Multidimensional Cube Packing , 2004, Algorithmica.

[12]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

[13]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

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

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

[16]  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).

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

[18]  Alberto Caprara,et al.  An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem , 2002, IPCO.

[19]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[20]  Ingo Schiermeyer,et al.  Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles , 1994, ESA.

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

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

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

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