A (5 / 3 + ε ) -Approximation for Strip Packing ∗

We study strip packing, which is one of the most classical two-dimensional packing problems: Given a collection of rectangles, the problem is to find a feasible orthogonal packing without rotations into a strip of width 1 and minimum height. In this paper we present an approximation algorithm for the strip packing problem with approximation ratio of 5/3 + e for any e > 0. This result significantly narrows the gap between the best known upper bounds of 2 by Schiermeyer and Steinberg and 1.9396 by Harren and van Stee and the lower bound of 3/2.

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

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

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

[4]  Igal Golan,et al.  Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms , 1981, SIAM J. Comput..

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

[6]  Klaus Jansen,et al.  Maximizing the Total Profit of Rectangles Packed into a Rectangle , 2007, Algorithmica.

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

[8]  Rob van Stee,et al.  Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems , 2009, APPROX-RANDOM.

[9]  Brenda S. Baker,et al.  A 5/4 Algorithm for Two-Dimensional Packing , 1981, J. Algorithms.

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

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

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

[13]  Daniel Dominic Sleator,et al.  A 2.5 Times Optimal Algorithm for Packing in Two Dimensions , 1980, Inf. Process. Lett..

[14]  Klaus Jansen,et al.  Two for One: Tight Approximation of 2D Bin Packing , 2009, WADS.

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

[16]  Klaus Jansen,et al.  Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 , 2008, ICALP.

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