2000 character limit reached
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
Published 4 Apr 2024 in cs.DS | (2404.03747v2)
Abstract: We consider the problem of finding a basis of a matroid with weight exactly equal to a given target. Here weights can be discrete values from ${-\Delta,\ldots,\Delta}$ or more generally $m$-dimensional vectors of such discrete values. We resolve the parameterized complexity completely, by presenting an FPT algorithm parameterized by $\Delta$ and $m$ for arbitrary matroids. Prior to our work, no such algorithms were known even when weights are in ${0,1}$, or arbitrary $\Delta$ and $m=1$. Our main technical contributions are new proximity and sensitivity bounds for matroid problems, independent of the number of elements. These bounds imply FPT algorithms via matroid intersection.
- School Choice: A Mechanism Design Approach. American economic review, 93(3):729–747, 2003.
- A Technique for Obtaining True Approximations for k𝑘kitalic_k-Center with Covering Constraints. Mathematical Programming, pages 1–25, 2022.
- A Constant Approximation for Colorful k𝑘kitalic_k-Center. In Proceedings of ESA, 2019.
- Exact arborescences, matchings and cycles. Discrete Applied Mathematics, 16(2):91–99, 1987.
- Approximation Algorithms for the Partition Vertex Cover Problem. Theoretical Computer Science, 555:2–8, 2014.
- Man is to Computer Programmer as Woman is to Homemaker? Debiasing Word Embeddings. Advances in Neural Information Processing Systems, 29, 2016.
- Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. Journal of Algorithms, 13(2):258–273, 1992.
- Ranking with Fairness Constraints. In Proceedings of ICALP, 2018.
- Sensitivity Theorems in Integer Linear Programming. Mathematical Programming, 34:251–264, 1986.
- Parameterized algorithms, volume 5. Springer, 2015.
- An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. In Proceedings of ICALP, 2023.
- An EPTAS for Budgeted Matroid Independent Set. In Proceedings of SOSA, pages 69–83. SIAM, 2023.
- Budgeted Matroid Maximization: a Parameterized Viewpoint. In Proceedings of IPEC, 2023.
- Tight Lower Bounds for Weighted Matroid Problems, 2023.
- Jack Edmonds. Submodular Functions, Matroids, and Certain Polyhedra. In Combinatorial structures and their applications. Gordon and Breach, 1970.
- Jack Edmonds. Matroid intersection. In Annals of discrete Mathematics, volume 4, pages 39–49. Elsevier, 1979.
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma. ACM Transactions on Algorithms (TALG), 16(1):1–14, 2019.
- Fixed-Parameter Algorithms for Closest String and Related Problems. Algorithmica, 37:25–42, 2003.
- Approximation Schemes for Multi-Budgeted Independence Systems. In Proceedings of ESA 2010.
- Geometric algorithms and combinatorial optimization, volume 2. Springer Science & Business Media, 2012.
- Problems on Group-labeled Matroid Bases. 2024.
- A Framework for Sensitivity Analysis in Discrete Multi-Objective Decision-Making. European journal of operational research, 54(2):176–190, 1991.
- Fair Colorful k𝑘kitalic_k-Center Clustering. Mathematical Programming, 192(1):339–360, 2022.
- Stability and Strategy-Proofness for Matching with Constraints: A Problem in the Japanese Medical Match and Its Solution. American Economic Review, 102(3):366–370, 2012.
- Ravindran Kannan. Polynomial-Time Aggregation of Integer Programming Problems. Journal of the ACM (JACM), 30(1):133–145, 1983.
- Leonid G. Khachiyan. Polynomial Algorithms in Linear Programming. USSR Computational Mathematics and Mathematical Physics, 20(1):53–72, 1980.
- Combinatorial n𝑛nitalic_n-fold integer programming and applications. Mathematical Programming, 184(1):1–34, 2020.
- There is No EPTAS for Two-dimensional Knapsack. Information Processing Letters, 110(16):707–710, 2010.
- Eugene L. Lawler. Matroid intersection algorithms. Mathematical programming, 9(1):31–56, 1975.
- On the Congruency-Constrained Matroid Base. In Proceedings of IPCO, 2024. to appear.
- Dániel Marx. A parameterized view on matroid optimization problems. Theoretical Computer Science, 410(44):4471–4479, 2009.
- Matching is as Easy as Matrix Inversion. In Proceedings of STOC 1987.
- Christos H. Papadimitriou. On the Complexity of Integer Programming. Journal of the ACM (JACM), 28(4):765–768, 1981.
- The Complexity of Restricted Spanning Tree Problems. Journal of the ACM (JACM), 29(2):285–309, 1982.
- Matchings with Group Fairness Constraints: Online and Offline Algorithms. In Proceedings of IJCAI 2021.
- Alexander Schrijver. Combinatorial Optimization: Polyhedra and Efficiency, volume 24. Springer.
- Spanning Trees of Different Weights. Polyhedral combinatorics, 1:281–288, 1990.
- A Sensitivity Analysis Approach for some Deterministic Multi-Criteria Decision-Making Methods. Decision sciences, 28(1):151–194, 1997.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.