Improved approximation for two dimensional Strip Packing with polynomial bounded width

Abstract We study the well-known two-dimensional Strip Packing problem. Given a set of rectangular axis-parallel items and a strip of width W with infinite height, the objective is to find a packing of all items into the strip, which minimizes the packing height. Lately, it has been shown that the lower bound of 3/2 of the absolute approximation ratio can be beaten when we allow a pseudo-polynomial running-time of type ( n W ) f ( 1 / e ) . If W is polynomially bounded by the number of items, this is a polynomial running-time. The currently best pseudo-polynomial approximation algorithm by Nadiradze and Wiese achieves an approximation ratio of 1.4 + e . We present a pseudo-polynomial algorithm with improved approximation ratio 4 / 3 + e . Furthermore, the presented algorithm has a significantly smaller running-time as the 1.4 + e approximation algorithm.

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

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

[3]  Klaus Jansen,et al.  Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing , 2018, CSR.

[4]  Klaus Jansen,et al.  A (5/3 + ε)-approximation for strip packing , 2014, Comput. Geom..

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

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

[7]  Klaus Jansen,et al.  Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width , 2017, WALCOM.

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

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

[10]  Michal Pilipczuk,et al.  Hardness of Approximation for Strip Packing , 2017, TOCT.

[11]  Klaus Jansen,et al.  Closing the gap for pseudo-polynomial strip packing , 2017, ESA.

[12]  Giorgi Nadiradze,et al.  On approximating strip packing with a better ratio than 3/2 , 2016, SODA.

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

[14]  Klaus Jansen,et al.  Approximation Algorithms for Scheduling Parallel Jobs , 2010, SIAM J. Comput..

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