Document Open Access Logo

Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns

Authors Alexandra Lassota , Koen Ligthart

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.112.pdf
  • Filesize: 0.9 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Combinatorial optimization
  • Theory of computation → Complexity classes
Keywords
  • Integer Programming
  • fixed-parameter Tractability
  • polyhedral Optimization
  • Matchings

Metrics

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

Abstract

We study integer linear programs (ILP) of the form min{c^⊤ x | Ax = b,l ≤ x ≤ u,x ∈ ℤⁿ} and analyze their parameterized complexity with respect to their distance to the generalized matching problem, following the well-established approach of capturing the hardness of a problem by the distance to triviality. The generalized matching problem is an ILP where each column of the constraint matrix has 1-norm of at most 2. It captures several well-known polynomial time solvable problems such as matching and flow problems. We parameterize by the size of variable and constraint backdoors, which measure the least number of columns or rows that must be deleted to obtain a generalized matching ILP. This extends generalized matching problems by allowing a parameterized number of additional arbitrary variables or constraints, yielding a novel parameter.
We present the following results: (i) a fixed-parameter tractable (FPT) algorithm for ILPs parameterized by the size p of a minimum variable backdoor to generalized matching; (ii) a randomized slice-wise polynomial (XP) time algorithm for ILPs parameterized by the size h of a minimum constraint backdoor to generalized matching as long as c and A are encoded in unary; (iii) we complement (ii) by proving that solving an ILP is W[1]-hard when parameterized by h even when c,A,l,u have coefficients of constant size. To obtain (i), we prove a variant of lattice-convexity of the degree sequences of weighted b-matchings, which we study in the light of SBO jump M-convex functions. This allows us to model the matching part as a polyhedral constraint on the integer backdoor variables. The resulting ILP is solved in FPT time using an integer programming algorithm. For (ii), the randomized XP time algorithm is obtained by pseudo-polynomially reducing the problem to the exact matching problem. To prevent an exponential blowup in terms of the encoding length of b, we bound the Graver complexity of the constraint matrix and employ a Graver augmentation local search framework. The hardness result (iii) is obtained through a parameterized reduction from ILP with h constraints and coefficients encoded in unary.

Cite As Get BibTex

Alexandra Lassota and Koen Ligthart. Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 112:1-112:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.112

Author Details

Alexandra Lassota
  • Eindhoven University of Technology, The Netherlands
Koen Ligthart
  • Eindhoven University of Technology, The Netherlands

References

  1. Richard P. Anstee and Yunsun Nam. Convexity of degree sequences. Journal of Graph Theory, 30(2):147-156, 1999. URL: https://doi.org/10.1002/(SICI)1097-0118(199902)30:2%3C147::AID-JGT8%3E3.0.CO;2-C.
  2. Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Miehal T. Seweryn, Stefan Weltge, and Yelena Yuditsky. Integer programs with nearly totally unimodular matrices: the cographic case. In Proceedings of the 2025 ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 2301-2312, 2025. URL: https://doi.org/10.1137/1.9781611978322.76.
  3. Egon Balas and William R. Pulleyblank. The perfectly matchable subgraph polytope of a bipartite graph. Networks, 13(4):495-516, 1983. URL: https://doi.org/10.1002/net.3230130405.
  4. Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, and Malte Skambath. Solving packing problems with few small items using rainbow matchings. In Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, MFCS, pages 11:1-11:14, 2020. URL: https://doi.org/10.4230/LIPIcs.MFCS.2020.11.
  5. John Bartholdi, Craig A Tovey, and Michael A Trick. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6(2):157-165, 1989. URL: https://doi.org/10.1007/BF00303169.
  6. André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, and Guido Schäfer. Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Mathematical Programming, 128(1-2):355-372, 2011. URL: https://doi.org/10.1007/s10107-009-0307-4.
  7. Sebastian Berndt, Matthias Mnich, and Tobias Stamm. New support size bounds and proximity bounds for integer linear programming. In Proceedings of the 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM, pages 82-95, 2024. URL: https://doi.org/10.1007/978-3-031-52113-3_6.
  8. André Bouchet and William H. Cunningham. Delta-matroids, jump systems, and bisubmodular polyhedra. SIAM Journal on Discrete Mathematics, 8(1):17-32, 1995. URL: https://doi.org/10.1137/S0895480191222926.
  9. Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, and Felix Schröder. Characterization of matrices with bounded graver bases and depth parameters and applications to integer programming. Mathematical Programming, 208(1-2):497-531, 2024. URL: https://doi.org/10.1007/s10107-023-02048-x.
  10. Paolo M. Camerini, Giulia Galbiati, and Francesco Maffioli. Random pseudo-polynomial algorithms for exact matroid problems. Journal of Algorithms, 13(2):258-273, 1992. URL: https://doi.org/10.1016/0196-6774(92)90018-8.
  11. William J. Cook, Albertus M. H. Gerards, Alexander Schrijver, and Éva Tardos. Sensitivity theorems in integer linear programming. Mathematical Programming, 34(3):251-264, 1986. URL: https://doi.org/10.1007/BF01582230.
  12. Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, and Adam Polak. Parameterized algorithms for block-structured integer programs with large entries. In Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 740-751, 2024. URL: https://doi.org/10.1137/1.9781611977912.29.
  13. Pavel Dvořák, Eduard Eiben, Robert Ganian, Dusan Knop, and Sebastian Ordyniak. The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints. Artificial Intelligence, 300:103561, 2021. URL: https://doi.org/10.1016/j.artint.2021.103561.
  14. Jack Edmonds and Ellis L. Johnson. Matching: A well-solved class of integer linear programs. In Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications, pages 89-92, 1970. URL: https://doi.org/10.1007/3-540-36478-1_3.
  15. Jack Edmonds and Ellis L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical Programming, 5(1):88-124, 1973. URL: https://doi.org/10.1007/BF01580113.
  16. Friedrich Eisenbrand, Christoph Hunkenschröder, and Kim-Manuel Klein. Faster algorithms for integer programs with block structure. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP, pages 49:1-49:13, 2018. URL: https://doi.org/10.4230/LIPIcs.ICALP.2018.49.
  17. Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, and Shmuel Onn. An algorithmic theory of integer programming, 2019. URL: https://arxiv.org/abs/1904.01361.
  18. Friedrich Eisenbrand and Thomas Rothvoss. A parameterized linear formulation of the integer hull, 2025. URL: https://doi.org/10.48550/arXiv.2501.02347.
  19. T. Ermolieva, Y Ermoliev, P. Havlik, A. Lessa-Derci-Augustynczik, N. Komendantova, T. Kahil, J. Balkovic, R. Skalsky, C. Folberth, P. S. Knopov, and G. Wang. Connections between robust statistical estimation, robust decision-making with two-stage stochastic optimization, and robust machine learning problems. Cybernetics and Systems Analysis, 59(3):385-397, 2023. URL: https://doi.org/10.1007/s10559-023-00573-3.
  20. Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, and Saket Saurabh. Graph layout problems parameterized by vertex cover. In Proceedings of the 19th International Symposium on Algorithms and Computation, ISAAC, pages 294-305, 2008. URL: https://doi.org/10.1007/978-3-540-92182-0_28.
  21. Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, and Jan Kratochvíl. Parameterized complexity of distance labeling and uniform channel assignment problems. Discrete Applied Mathematics, 248:46-55, 2018. URL: https://doi.org/10.1016/j.dam.2017.02.010.
  22. Samuel Fiorini, Gwenaël Joret, Stefan Weltge, and Yelena Yuditsky. Integer programs with bounded subdeterminants and two nonzeros per row. In Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS, pages 13-24, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00011.
  23. Serge Gaspers and Stefan Szeider. Backdoors to satisfaction. In The Multivariate Algorithmic Revolution and Beyond, pages 287-317. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-30891-8_15.
  24. Tomáš Gavenčiak, Martin Koutecký, and Dušan Knop. Integer programming in parameterized complexity: Five miniatures. Discrete Optimization, 44(Part 1):100596, 2022. URL: https://doi.org/10.1016/j.disopt.2020.100596.
  25. Michel X. Goemans and Thomas Rothvoss. Polynomiality for bin packing with a constant number of item types. Journal of the ACM, 67(6):38:1-38:21, 2020. URL: https://doi.org/10.1145/3421750.
  26. Jens Gramm, Rolf Niedermeier, and Peter Rossmanith. Fixed-parameter algorithms for CLOSEST STRING and related problems. Algorithmica, 37(1):25-42, 2003. URL: https://doi.org/10.1007/s00453-003-1028-3.
  27. Martin Grötschel, László Lovász, and Alexander Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, 1988. URL: https://doi.org/10.1007/978-3-642-97881-4.
  28. Raymond Hemmecke, Matthias Köppe, and Robert Weismantel. A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs. In Proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization, IPCO, pages 219-229, 2010. URL: https://doi.org/10.1007/978-3-642-13036-6_17.
  29. Raymond Hemmecke, Matthias Köppe, and Robert Weismantel. Graver basis and proximity techniques for block-structured separable convex integer minimization problems. Mathematical Programming, 145(1-2):1-18, 2014. URL: https://doi.org/10.1007/s10107-013-0638-z.
  30. Raymond Hemmecke, Shmuel Onn, and Lyubov Romanchuk. n-Fold integer programming in cubic time. Mathematical Programming, 137(1-2):325-341, 2013. URL: https://doi.org/10.1007/s10107-011-0490-y.
  31. Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, and Asaf Levin. Tight lower bounds for block-structured integer programs. In Proceedings of the 25th International Conference on Integer Programming and Combinatorial Optimization, IPCO, pages 224-237, 2024. URL: https://doi.org/10.1007/978-3-031-59835-7_17.
  32. Klaus Jansen, Kim-Manuel Klein, Marten Maack, and Malin Rau. Empowering the configuration-ip: new PTAS results for scheduling with setup times. Math. Program., 195(1):367-401, 2022. URL: https://doi.org/10.1007/s10107-021-01694-3.
  33. Hendrik W. Lenstra Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4):538-548, 1983. URL: https://doi.org/10.1287/moor.8.4.538.
  34. Dusan Knop, Martin Koutecký, and Matthias Mnich. Voting and bribing in single-exponential time. ACM Transactions on Economics and Computation, 8(3):12:1-12:28, 2020. URL: https://doi.org/10.1145/3396855.
  35. Yusuke Kobayashi. Optimal general factor problem and jump system intersection. In Proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO, pages 291-305, 2023. URL: https://doi.org/10.1007/978-3-031-32726-1_21.
  36. Alexandra Lassota and Koen Ligthart. Parameterized algorithms for matching integer programs with additional rows and columns, 2025. URL: https://doi.org/10.48550/arXiv.2503.05548.
  37. László Lovász. The factorization of graphs. II. Acta Mathematica Academiae Scientiarum Hungarica, 23(1-2):223-246, 1972. URL: https://doi.org/10.1007/BF01889919.
  38. Ketan Mulmuley, Umesh V. Vazirani, and Vijay V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7(1):105-113, 1987. URL: https://doi.org/10.1007/BF02579206.
  39. Kazuo Murota. M-convex functions on jump systems: A general framework for minsquare graph factor problem. SIAM Journal on Discrete Mathematics, 20(1):213-226, 2006. URL: https://doi.org/10.1137/040618710.
  40. Kazuo Murota and Ken'ichiro Tanaka. A steepest descent algorithm for M-convex functions on jump systems. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E89-A(5):1160-1165, 2006. URL: https://doi.org/10.1093/ietfec/e89-a.5.1160.
  41. Martin Nägele, Richard Santiago, and Rico Zenklusen. Congruency-constrained TU problems beyond the bimodular case. Mathematics of Operations Research, 49(3):1303-1348, 2024. URL: https://doi.org/10.1287/moor.2023.1381.
  42. Rolf Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006. URL: https://doi.org/10.1093/ACPROF:OSO/9780198566076.001.0001.
  43. Christos H. Papadimitriou and Mihalis Yannakakis. The complexity of restricted spanning tree problems. Journal of the ACM, 29(2):285-309, 1982. URL: https://doi.org/10.1145/322307.322309.
  44. Victor Reis and Thomas Rothvoss. The subspace flatness conjecture and faster integer programming. In Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS, pages 974-988, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00060.
  45. Alexander Schrijver. Combinatorial optimization: polyhedra and efficiency, volume 24 of Algorithms and Combinatorics. Springer, 2003. URL: https://link.springer.com/book/9783540443896.
  46. Fan Zhang. A separation algorithm for b-matching degree-sequence polyhedra. Mathematics of Operations Research, 28(1):92-102, 2003. URL: https://doi.org/10.1287/moor.28.1.92.14263.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact