Lower Bounds for Matroid Optimization Problems with a Linear Constraint

Authors Ilan Doron-Arad , Ariel Kulik , Hadas Shachnai



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.56.pdf
  • Filesize: 0.9 MB
  • 20 pages

Document Identifiers

Author Details

Ilan Doron-Arad
  • Computer Science Department, Technion, Haifa, Israel
Ariel Kulik
  • Computer Science Department, Technion, Haifa, Israel
Hadas Shachnai
  • Computer Science Department, Technion, Haifa, Israel

Cite AsGet BibTex

Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai. Lower Bounds for Matroid Optimization Problems with a Linear Constraint. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 56:1-56:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.56

Abstract

We study a family of matroid optimization problems with a linear constraint (MOL). In these problems, we seek a subset of elements which optimizes (i.e., maximizes or minimizes) a linear objective function subject to (i) a matroid independent set, or a matroid basis constraint, (ii) additional linear constraint. A notable member in this family is budgeted matroid independent set (BM), which can be viewed as classic 0/1-Knapsack with a matroid constraint. While special cases of BM, such as knapsack with cardinality constraint and multiple-choice knapsack, admit a fully polynomial-time approximation scheme (Fully PTAS), the best known result for BM on a general matroid is an Efficient PTAS. Prior to this work, the existence of a Fully PTAS for BM, and more generally, for any problem in the family of MOL problems, has been open. In this paper, we answer this question negatively by showing that none of the (non-trivial) problems in this family admits a Fully PTAS. This resolves the complexity status of several well studied problems. Our main result is obtained by showing first that exact weight matroid basis (EMB) does not admit a pseudo-polynomial time algorithm. This distinguishes EMB from the special cases of k-subset sum and EMB on a linear matroid, which are solvable in pseudo-polynomial time. We then obtain unconditional hardness results for the family of MOL problems in the oracle model (even if randomization is allowed), and show that the same results hold when the matroids are encoded as part of the input, assuming P ≠ NP. For the hardness proof of EMB, we introduce the Π-matroid family. This intricate subclass of matroids, which exploits the interaction between a weight function and the matroid constraint, may find use in tackling other matroid optimization problems.

Subject Classification

ACM Subject Classification
  • Theory of computation
Keywords
  • matroid optimization
  • budgeted problems
  • knapsack
  • approximation schemes

Metrics

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

References

  1. Kim Allan Andersen, Kurt Jörnsten, and Mikael Lind. On bicriterion minimal spanning trees: An approximation. Computers & Operations Research, 23(12):1171-1182, 1996. Google Scholar
  2. André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, and Guido Schäfer. Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Mathematical Programming, 128(1):355-372, 2011. Google Scholar
  3. Karl Bringmann and Vasileios Nakos. A fine-grained perspective on approximating subset sum and partition. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1797-1815. SIAM, 2021. Google Scholar
  4. Gruia Calinescu, Chandra Chekuri, Martin Pal, and Jan Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 40(6):1740-1766, 2011. Google Scholar
  5. Paolo M. Camerini, Giulia Galbiati, and Francesco Maffioli. Random pseudo-polynomial algorithms for exact matroid problems. Journal of Algorithms, 13(2):258-273, 1992. Google Scholar
  6. Ran Canetti, Oded Goldreich, and Shai Halevi. The random oracle methodology, revisited. Journal of the ACM (JACM), 51(4):557-594, 2004. Google Scholar
  7. Alberto Caprara, Hans Kellerer, Ulrich Pferschy, and David Pisinger. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research, 123(2):333-345, 2000. Google Scholar
  8. Venkatesan T Chakaravarthy, Anamitra Roy Choudhury, Sivaramakrishnan R Natarajan, and Sambuddha Roy. Knapsack cover subject to a matroid constraint. In Proc. FSTTCS, 2013. Google Scholar
  9. Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, and Pankaj Rohatgi. The random oracle hypothesis is false. Journal of Computer and System Sciences, 49(1):24-39, 1994. Google Scholar
  10. Chandra Chekuri and Sanjeev Khanna. A polynomial time approximation scheme for the multiple knapsack problem. SIAM Journal on Computing, 35(3):713-728, 2005. Google Scholar
  11. Chandra Chekuri, Jan Vondrák, and Rico Zenklusen. Dependent randomized rounding via exchange properties of combinatorial structures. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pages 575-584. IEEE, 2010. Google Scholar
  12. Chandra Chekuri, Jan Vondrák, and Rico Zenklusen. Multi-budgeted matchings and matroid intersection via dependent rounding. In Proc. SODA, pages 1080-1097, 2011. Google Scholar
  13. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2022. Google Scholar
  14. Marek Cygan, Marcin Mucha, Karol Wegrzycki, and MichaI WIodarczyk. On problems equivalent to (min,+)-convolution. ACM Transactions on Algorithms (TALG), 15(1):1-25, 2019. Google Scholar
  15. Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai. An AFPTAS for bin packing with partition matroid via a new method for LP rounding. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2023. Google Scholar
  16. Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai. Budgeted matroid maximization: A parameterized viewpoint. IPEC, 2023. Google Scholar
  17. Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai. An EPTAS for budgeted matching and budgeted matroid intersection via representative sets. In Proc. ICALP, pages 49:1-49:16, 2023. Google Scholar
  18. Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai. An EPTAS for budgeted matroid independent set. In Proc. SOSA, pages 69-83, 2023. Google Scholar
  19. Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai. An FPTAS for budgeted laminar matroid independent set. Operations Research Letters, 51:632-637, 2023. Google Scholar
  20. Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai. Lower bounds for matroid optimization problems with a linear constraint. arXiv preprint, 2023. URL: https://arxiv.org/abs/2307.07773.
  21. Jack Edmonds. Minimum partition of a matroid into independent subsets. J. Res. Nat. Bur. Standards Sect. B, 69:67-72, 1965. Google Scholar
  22. Fedor V Fomin, Petr A Golovach, Tuukka Korhonen, Kirill Simonov, and Giannos Stamoulis. Fixed-parameter tractability of maximum colored path and beyond. In Proc. SODA, pages 3700-3712, 2023. Google Scholar
  23. András Frank. Connections in combinatorial optimization, volume 38. Oxford University Press Oxford, 2011. Google Scholar
  24. Kilian Grage, Klaus Jansen, and Kim-Manuel Klein. An EPTAS for machine scheduling with bag-constraints. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pages 135-144, 2019. Google Scholar
  25. Fabrizio Grandoni and Rico Zenklusen. Approximation schemes for multi-budgeted independence systems. In Proc. ESA, pages 536-548, 2010. Google Scholar
  26. Refael Hassin and Asaf Levin. An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM Journal on Computing, 33(2):261-268, 2004. Google Scholar
  27. Sung-Pil Hong, Sung-Jin Chung, and Bum Hwan Park. A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Operations Research Letters, 32(3):233-239, 2004. Google Scholar
  28. Per M Jensen and Bernhard Korte. Complexity of matroid property algorithms. SIAM Journal on Computing, 11(1):184-190, 1982. Google Scholar
  29. Richard M Karp, Eli Upfal, and Avi Wigderson. The complexity of parallel computation on matroids. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pages 541-550. IEEE, 1985. Google Scholar
  30. Ariel Kulik and Hadas Shachnai. There is no EPTAS for two-dimensional knapsack. Information Processing Letters, 110(16):707-710, 2010. Google Scholar
  31. Eugene L Lawler. Matroid intersection algorithms. Mathematical programming, 9(1):31-56, 1975. Google Scholar
  32. Eugene L. Lawler. Fast approximation algorithms for knapsack problems. Math. Oper. Res., 4(4):339-356, 1979. Google Scholar
  33. László Lovász. The matroid matching problem. Algebraic methods in graph theory, 2:495-517, 1978. Google Scholar
  34. James G Oxley. Matroid theory, volume 3. Oxford University Press, USA, 2006. Google Scholar
  35. Rudi Pendavingh and Jorn Van der Pol. On the number of matroids compared to the number of sparse paving matroids. arXiv preprint, 2014. URL: https://arxiv.org/abs/1411.0935.
  36. Ram Ravi and Michel X Goemans. The constrained minimum spanning tree problem. In Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory Reykjavík, Iceland, July 3-5, 1996 Proceedings 5, pages 66-75. Springer, 1996. Google Scholar
  37. Alexander Schrijver. Combinatorial optimization: polyhedra and efficiency, volume 24. Springer, 2003. Google Scholar
  38. Prabhakant Sinha and Andris A Zoltners. The multiple-choice knapsack problem. Operations Research, 27(3):503-515, 1979. Google Scholar
  39. José A Soto. A simple PTAS for weighted matroid matching on strongly base orderable matroids. Discrete Applied Mathematics, 164:406-412, 2014. Google Scholar
  40. Maxim Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint. Operations Research Letters, 32(1):41-43, 2004. Google Scholar