Document Open Access Logo

A PTAS for Packing Hypercubes into a Knapsack

Authors Klaus Jansen, Arindam Khan , Marvin Lira, K. V. N. Sreenivas

Thumbnail PDF


  • Filesize: 0.81 MB
  • 20 pages

Document Identifiers

Author Details

Klaus Jansen
  • Universität Kiel, Germany
Arindam Khan
  • Department of Computer Science and Automation, Indian Institute of Science, Bengaluru, India
Marvin Lira
  • Universität Kiel, Germany
K. V. N. Sreenivas
  • Department of Computer Science and Automation, Indian Institute of Science, Bengaluru, India


We thank Roberto Solis-Oba and three anonymous reviewers for their comments and suggestions on this paper.

Cite AsGet BibTex

Klaus Jansen, Arindam Khan, Marvin Lira, and K. V. N. Sreenivas. A PTAS for Packing Hypercubes into a Knapsack. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 78:1-78:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)


We study the d-dimensional hypercube knapsack problem ({d}-D Hc-Knapsack) where we are given a set of d-dimensional hypercubes with associated profits, and a knapsack which is a unit d-dimensional hypercube. The goal is to find an axis-aligned non-overlapping packing of a subset of hypercubes such that the profit of the packed hypercubes is maximized. For this problem, Harren (ICALP'06) gave an algorithm with an approximation ratio of (1+1/2^d+ε). For d = 2, Jansen and Solis-Oba (IPCO'08) showed that the problem admits a polynomial-time approximation scheme (PTAS); Heydrich and Wiese (SODA'17) further improved the running time and gave an efficient polynomial-time approximation scheme (EPTAS). Both the results use structural properties of 2-D packing, which do not generalize to higher dimensions. For d > 2, it remains open to obtain a PTAS, and in fact, there has been no improvement since Harren’s result. We settle the problem by providing a PTAS. Our main technical contribution is a structural lemma which shows that any packing of hypercubes can be converted into another structured packing such that a high profitable subset of hypercubes is packed into a constant number of special hypercuboids, called 𝒱-Boxes and 𝒩-Boxes. As a side result, we give an almost optimal algorithm for a variant of the strip packing problem in higher dimensions. This might have applications for other multidimensional geometric packing problems.

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
  • Multidimensional knapsack
  • geometric packing
  • cube packing
  • strip packing


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Fidaa Abed, Parinya Chalermsook, José R. Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, and Andreas Wiese. On guillotine cutting sequences. In APPROX, pages 1-19, 2015. Google Scholar
  2. Anna Adamaszek, Sariel Har-Peled, and Andreas Wiese. Approximation schemes for independent set and sparse subsets of polygons. Journal of the ACM, 66(4):29:1-29:40, 2019. Google Scholar
  3. Anna Adamaszek and Andreas Wiese. A quasi-PTAS for the two-dimensional geometric knapsack problem. In SODA, pages 1491-1505, 2015. Google Scholar
  4. Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, and Maxim Sviridenko. A structural lemma in 2-dimensional packing, and its implications on approximability. In ISAAC, pages 77-86, 2009. Google Scholar
  5. Nikhil Bansal, José R Correa, Claire Kenyon, and Maxim Sviridenko. Bin packing in multiple dimensions: inapproximability results and approximation schemes. Mathematics of operations research, 31(1):31-49, 2006. Google Scholar
  6. Nikhil Bansal, Marek Eliáš, and Arindam Khan. Improved approximation for vector bin packing. In SODA, pages 1561-1579. SIAM, 2016. Google Scholar
  7. Nikhil Bansal and Arindam Khan. Improved approximation algorithm for two-dimensional bin packing. In SODA, pages 13-25, 2014. Google Scholar
  8. Nikhil Bansal, Andrea Lodi, and Maxim Sviridenko. A tale of two dimensional bin packing. In FOCS, pages 657-666, 2005. Google Scholar
  9. Alberto Caprara. Packing d-dimensional bins in d stages. Mathematics of Operations Research, 33(1):203-215, 2008. Google Scholar
  10. Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, and Prasad Tetali. Approximation and online algorithms for multidimensional bin packing: A survey. Computer Science Review, 24:63-79, 2017. Google Scholar
  11. Edward G Coffman, Jr, Michael R Garey, David S Johnson, and Robert Endre Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4):808-826, 1980. Google Scholar
  12. W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1 + ε in linear time. Combinatorica, 1:349-355, 1981. Google Scholar
  13. Max A Deppert, Klaus Jansen, Arindam Khan, Malin Rau, and Malte Tutas. Peak demand minimization via sliced strip packing. In APPROX/RANDOM, volume 207, pages 21:1-21:24, 2021. Google Scholar
  14. Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, and Henning Thomas. Approximation algorithms for 3d orthogonal knapsack. Journal of Computer Science and Technology, 23(5):749, 2008. Google Scholar
  15. Alan M Frieze, Michael RB Clarke, et al. Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses. European Journal of Operational Research, 15(1):100-109, 1984. Google Scholar
  16. Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, and Malin Rau. A tight (3/2+ε) approximation for skewed strip packing. In APPROX/RANDOM, volume 176, pages 44:1-44:18, 2020. Google Scholar
  17. Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, and Kamyar Khodamoradi. Approximation algorithms for demand strip packing. In Mary Wootters and Laura Sanità, editors, APPROX/RANDOM, volume 207 of LIPIcs, pages 20:1-20:24, 2021. Google Scholar
  18. Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, and Andreas Wiese. Approximating geometric knapsack via l-packings. In FOCS, pages 260-271, 2017. Google Scholar
  19. Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, and Andreas Wiese. Improved approximation algorithms for 2-dimensional knapsack: Packing into multiple l-shapes, spirals, and more. In SoCG, volume 189 of LIPIcs, pages 39:1-39:17, 2021. Google Scholar
  20. Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, and Andreas Wiese. A (2+ε)-approximation algorithm for maximum independent set of rectangles. CoRR, abs/2106.00623, 2021. URL:
  21. Rolf Harren. Approximation algorithms for orthogonal packing problems for hypercubes. Theoretical Computer Science, 410(44):4504-4532, 2009. Google Scholar
  22. Rolf Harren, Klaus Jansen, Lars Prädel, and Rob Van Stee. A (5/3+ ε)-approximation for strip packing. Computational Geometry, 47(2):248-267, 2014. Google Scholar
  23. Sandy Heydrich and Andreas Wiese. Faster approximation schemes for the two-dimensional knapsack problem. In SODA, pages 79-98, 2017. Google Scholar
  24. Klaus Jansen, Arindam Khan, Marvin Lira, and K. V. N. Sreenivas. A ptas for packing hypercubes into a knapsack, 2022. URL:
  25. Klaus Jansen and Malin Rau. Closing the gap for pseudo-polynomial strip packing. In ESA, volume 144 of LIPIcs, pages 62:1-62:14, 2019. Google Scholar
  26. Klaus Jansen and Roberto Solis-Oba. Packing squares with profits. SIAM Journal on Discrete Mathematics, 26:263-279, January 2012. URL:
  27. Klaus Jansen and Guochuan Zhang. Maximizing the total profit of rectangles packed into a rectangle. Algorithmica, 47(3):323-342, 2007. Google Scholar
  28. Claire Kenyon and Eric Rémila. A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 25(4):645-656, 2000. Google Scholar
  29. Arindam Khan. Approximation algorithms for multidimensional bin packing. PhD thesis, Georgia Institute of Technology, 2015. Google Scholar
  30. Arindam Khan, Arnab Maiti, Amatya Sharma, and Andreas Wiese. On guillotine separable packings for the two-dimensional geometric knapsack problem. In SoCG, volume 189, pages 48:1-48:17, 2021. Google Scholar
  31. Arindam Khan and Madhusudhan Reddy Pittu. On guillotine separability of squares and rectangles. In APPROX/RANDOM, pages 47:1-47:22, 2020. Google Scholar
  32. Arindam Khan and Eklavya Sharma. Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items. In APPROX/RANDOM, pages 22:1-22:23, 2021. Google Scholar
  33. Arindam Khan, Eklavya Sharma, and K. V. N. Sreenivas. Approximation algorithms for generalized multidimensional knapsack. CoRR, abs/2102.05854, 2021. Google Scholar
  34. Arindam Khan, Eklavya Sharma, and K. V. N. Sreenivas. Geometry meets vectors: Approximation algorithms for multidimensional packing. CoRR, abs/2106.13951, 2021. URL:
  35. E. L. Lawler. Fast approximation algorithms for knapsack problems. Mathematics of Operations Research, 4(4):339-356, 1979. Google Scholar
  36. Joseph Y. T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young, and Francis Y. L. Chin. Packing squares into a square. Journal of Parallel and Distributed Computing, 10(3):271-275, 1990. Google Scholar
  37. Yiping Lu, Danny Z Chen, and Jianzhong Cha. Packing cubes into a cube in (d > 3)-dimensions. In COCOON, pages 264-276. Springer, 2015. Google Scholar
  38. Yiping Lu, Danny Z Chen, and Jianzhong Cha. Packing cubes into a cube is np-complete in the strong sense. Journal of Combinatorial Optimization, 29(1):197-215, 2015. Google Scholar
  39. Deval Patel, Arindam Khan, and Anand Louis. Group fairness for knapsack problems. In AAMAS, pages 1001-1009, 2021. Google Scholar
  40. Sai Sandeep. Almost optimal inapproximability of multidimensional packing problems. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 245-256, 2022. URL:
  41. Eklavya Sharma. Harmonic Algorithms for Packing d-Dimensional Cuboids into Bins. In FSTTCS, pages 32:1-32:22, 2021. Google Scholar
  42. David B Shmoys and Éva Tardos. An approximation algorithm for the generalized assignment problem. Mathematical programming, 62(1):461-474, 1993. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail