Document

# Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically

## File

LIPIcs.SoCG.2024.26.pdf
• Filesize: 0.86 MB
• 14 pages

## Cite As

Moritz Buchem, Paul Deuker, and Andreas Wiese. Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 26:1-26:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SoCG.2024.26

## Abstract

One important goal in algorithm design is determining the best running time for solving a problem (approximately). For some problems, we know the optimal running time, assuming certain conditional lower bounds. In this paper, we study the d-dimensional geometric knapsack problem in which we are far from this level of understanding. We are given a set of weighted d-dimensional geometric items like squares, rectangles, or hypercubes and a knapsack which is a square or a (hyper-)cube. Our goal is to select a subset of the given items that fit non-overlappingly inside the knapsack, maximizing the total profit of the packed items. We make a significant step towards determining the best running time for solving these problems approximately by presenting approximation algorithms whose running times are near-linear, i.e., O(n⋅poly(log n)), for any constant d and any parameter ε > 0 (the exponent of log n depends on d and 1/ε). In the case of (hyper)-cubes, we present a (1+ε)-approximation algorithm. This improves drastically upon the currently best known algorithm which is a (1+ε)-approximation algorithm with a running time of n^{O_{ε,d}(1)} where the exponent of n depends exponentially on 1/ε and d. In particular, our algorithm is an efficient polynomial time approximation scheme (EPTAS). Moreover, we present a (2+ε)-approximation algorithm for rectangles in the setting without rotations and a (17/9+ε)≈ 1.89-approximation algorithm if we allow rotations by 90 degrees. The best known polynomial time algorithms for this setting have approximation ratios of 17/9+ε and 1.5+ε, respectively, and running times in which the exponent of n depends exponentially on 1/ε. In addition, we give dynamic algorithms with polylogarithmic query and update times, having the same approximation guarantees as our other algorithms above. Key to our results is a new family of structured packings which we call easily guessable packings. They are flexible enough to guarantee the existence of profitable solutions while providing enough structure so that we can compute these solutions very quickly.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Packing and covering problems
##### Keywords
• Geometric packing
• approximation algorithms
• dynamic algorithms

## Metrics

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

## References

1. Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. Quadratic-time hardness of lcs and other sequence similarity measures. In Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015), pages 59-78, 2015.
2. Amir Abboud, Karl Bringmann, and Nick Fischer. Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC 2023), pages 391-404, 2023.
3. Anna Adamaszek and Andreas Wiese. A quasi-PTAS for the two-dimensional geometric knapsack problem. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pages 1491-1505, 2014.
4. Karl Bringmann. Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails. In Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS 2014), pages 661-670, 2014.
5. Karl Bringmann and Marvin Künnemann. Quadratic conditional lower bounds for string problems and dynamic time warping. In Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS 2015), pages 79-97, 2015.
6. Karl Bringmann and Marvin Künnemann. Multivariate fine-grained complexity of longest common subsequence. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), pages 1216-1235, 2018.
7. Moritz Buchem, Paul Deuker, and Andreas Wiese. Approximating the geometric knapsack problem in near-linear time and dynamically, 2024. URL: https://arxiv.org/abs/2403.00536.
8. Chandra Chekuri and Sanjeev Khanna. A polynomial time approximation scheme for the multiple knapsack problem. SIAM Journal on Computing, 35(3):713-728, 2005.
9. Marek Cygan, Marcin Mucha, Karol Węgrzycki, and Michał Włodarczyk. On problems equivalent to (min,+)-convolution. ACM Transactions on Algorithms (TALG), 15(1):1-25, 2019.
10. Mingyang Deng, Ce Jin, and Xiao Mao. Approximating knapsack and partition via dense subset sums. In Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), pages 2961-2979, 2023.
11. Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, and Andreas Wiese. Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. In Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), pages 18:1-18:17, 2021.
12. Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, and Andreas Wiese. Approximating geometric knapsack via L-packings. ACM Transactions on Algorithms (TALG), 17(4):1-67, 2021.
13. 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 Proceedings of the 37th International Symposium on Computational Geometry (SoCG 2021), pages 39:1-39:17, 2021.
14. Leo J. Guibas and Robert Sedgewick. A dichromatic framework for balanced trees. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science (SFCS 1978), pages 8-21, 1978.
15. Rolf Harren. Approximation algorithms for orthogonal packing problems for hypercubes. Theoretical Computer Science, 410(44):4504-4532, 2009.
16. Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC 2015), pages 21-30, 2015.
17. Monika Henzinger, Stefan Neumann, Harald Räcke, and Stefan Schmid. Dynamic Maintenance of Monotone Dynamic Programs and Applications. In Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), pages 36:1-36:16, 2023.
18. Sandy Heydrich and Andreas Wiese. Faster approximation schemes for the two-dimensional knapsack problem. ACM Transactions on Algorithms (TALG), 15(4):1-28, 2019.
19. Klaus Jansen. On rectangle packing: maximizing benefits. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), 2004.
20. Klaus Jansen. Parameterized approximation scheme for the multiple knapsack problem. SIAM Journal on Computing, 39(4):1392-1412, 2010.
21. Klaus Jansen. A fast approximation scheme for the multiple knapsack problem. In Proceedings of the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), pages 313-324, 2012.
22. Klaus Jansen, Arindam Khan, Marvin Lira, and K. V. N. Sreenivas. A PTAS for Packing Hypercubes into a Knapsack. In Proceedings of the 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), pages 78:1-78:20, 2022.
23. Klaus Jansen and Guochuan Zhang. Maximizing the number of packed rectangles. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), pages 362-371, 2004.
24. Hans Kellerer. A polynomial time approximation scheme for the multiple knapsack problem. In Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX 1999), pages 51-62, 1999.
25. Marvin Künnemann, Ramamohan Paturi, and Stefan Schneider. On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), pages 21:1-21:15, 2017.
26. D. T. Lee and Franco P. Preparata. Computational geometry - a survey. IEEE Transactions on Computers, 100(12):1072-1101, 1984.
27. Arturo Merino and Andreas Wiese. On the Two-Dimensional Knapsack Problem for Convex Polygons. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), pages 84:1-84:16, 2020.
28. Liam Roditty and Virginia Vassilevska Williams. Fast approximation algorithms for the diameter and radius of sparse graphs. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), pages 515-524, 2013.
29. Virginia Vassilevska Williams and Ryan Williams. Subcubic equivalences between path, matrix and triangle problems. In Proceedings of the 51st Annual Symposium on Foundations of Computer Science (FOCS 2010), pages 645-654, 2010.
X

Feedback for Dagstuhl Publishing