Approximating Geometric Knapsack via L-Packings

We study the two-dimensional geometric knapsack problem (2DK) in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-aligned square knapsack. The goal is to find a (non-overlapping) packing of a maximum profit subset of items inside the knapsack (without rotating items). The best-known polynomial-time approximation factor for this problem (even just in the cardinality case) is 2+ε [Jansen and Zhang, SODA 2004]. In this paper we break the 2 approximation barrier, achieving a polynomialtime 17/9 + ε

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

[2]  Uriel Feige,et al.  Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

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

[4]  Klaus Jansen,et al.  A Polynomial Time Approximation Scheme for the Square Packing Problem , 2008, IPCO.

[5]  Vahab S. Mirrokni,et al.  Tight approximation algorithms for maximum general assignment problems , 2006, SODA '06.

[6]  Andreas Wiese,et al.  A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem , 2015, SODA.

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

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

[9]  Henrik I. Christensen,et al.  Approximation and online algorithms for multidimensional bin packing: A survey , 2017, Comput. Sci. Rev..

[10]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

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

[12]  Arindam Khan,et al.  Approximation algorithms for multidimensional bin packing , 2015 .

[13]  Fabrizio Grandoni,et al.  Improved Pseudo-Polynomial-Time Approximation for Strip Packing , 2018, FSTTCS.

[14]  Andreas Wiese,et al.  Approximation Schemes for Maximum Weight Independent Set of Rectangles , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[15]  Klaus Jansen,et al.  Maximizing the Number of Packed Rectangles , 2004, SWAT.

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

[17]  Andreas Wiese,et al.  Faster approximation schemes for the two-dimensional knapsack problem , 2017, SODA.

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

[19]  Klaus Jansen,et al.  Packing Weighted Rectangles into a Square , 2005, MFCS.

[20]  Andreas Wiese,et al.  Faster Approximation Schemes for the Two-Dimensional Knapsack Problem , 2019, ACM Trans. Algorithms.

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

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

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

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

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

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

[27]  Nikhil Bansal,et al.  Improved Approximation Algorithm for Two-Dimensional Bin Packing , 2014, SODA.

[28]  Klaus Jansen,et al.  New Approximability Results for 2-Dimensional Packing Problems , 2007, MFCS.

[29]  Rolf Harren,et al.  Approximating the Orthogonal Knapsack Problem for Hypercubes , 2006, ICALP.

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

[31]  Klaus Jansen,et al.  On Efficient Weighted Rectangle Packing with Large Resources , 2005, ISAAC.

[32]  Sanjeev Khanna,et al.  A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 2005, SIAM J. Comput..

[33]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).