Improved Approximation Algorithm for Two-Dimensional Bin Packing

We study the two-dimensional bin packing problem with and without rotations. Here we are given a set of two-dimensional rectangular items I and the goal is to pack these into a minimum number of unit square bins. We consider the orthogonal packing case where the edges of the items must be aligned parallel to the edges of the bin. Our main result is a 1.405-approximation for two-dimensional bin packing with and without rotation, which improves upon a recent 1.5 approximation due to Jansen and Pradel. We also show that a wide class of rounding based algorithms cannot improve upon the factor of 1.5.

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

[2]  Lars Prädel,et al.  Approximation Algorithms for Geometric Packing Problems , 2013 .

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

[4]  Klaus Jansen,et al.  New Approximability Results for Two-Dimensional Bin Packing , 2014, Algorithmica.

[5]  Miroslav Chlebík,et al.  Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations , 2006, CIAC.

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

[7]  Klaus Jansen,et al.  TwoForOneRevised Two for One : Tight approximation of 2 , 2013 .

[8]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

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

[10]  Klaus Jansen,et al.  Rectangle packing with one-dimensional resource augmentation , 2009, Discret. Optim..

[11]  David S. Johnson,et al.  Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .

[12]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[13]  Alberto Caprara,et al.  Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing , 2005, Math. Oper. Res..

[14]  Alberto Caprara,et al.  A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing , 2009, SIAM J. Comput..

[15]  Klaus Jansen,et al.  A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability , 2009, ISAAC.

[16]  Thomas Rothvoß,et al.  Approximating Bin Packing within O(log OPT * Log Log OPT) Bins , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

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

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

[19]  Wenceslas Fernandez de la Vega,et al.  Bin packing can be solved within 1+epsilon in linear time , 1981, Comb..

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[22]  Leonid Khachiyan,et al.  Approximate Max-Min Resource Sharing for Structured Concave Optimization , 2000, SIAM J. Optim..

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

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

[25]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[26]  Krzysztof Onak,et al.  Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems , 2007, SODA '07.

[27]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.