A weighted linear matroid parity algorithm

The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Lovász (1980) showed that this problem admits a min-max formula and a polynomial algorithm for linearly represented matroids. Since then efficient algorithms have been developed for the linear matroid parity problem. In this paper, we present a combinatorial, deterministic, strongly polynomial algorithm for the weighted linear matroid parity problem. The algorithm builds on a polynomial matrix formulation using Pfaffian and adopts a primal-dual approach with the aid of the augmenting path algorithm of Gabow and Stallmann (1986) for the unweighted problem.

[1]  Yutaro Yamaguchi.  Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity , 2016, ISAAC.

[2]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[3]  Fabrizio Grandoni,et al.  Steiner Tree Approximation via Iterative Randomized Rounding , 2013, JACM.

[4]  Francesco Maffioli,et al.  Random Pseudo-Polynomial Algorithms for Exact Matroid Problems , 1992, J. Algorithms.

[5]  Hans Jürgen Prömel,et al.  A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 , 2000, J. Algorithms.

[6]  Gyula Pap,et al.  Packing Non-Returning A-Paths* , 2007, Comb..

[7]  W. Mader.  Über die Maximalzahl kreuzungsfreierH-Wege , 1978 .

[8]  Gyula Pap,et al.  An algorithm for weighted fractional matroid matching , 2008, J. Comb. Theory B.

[9]  Satoru Iwata,et al.  A Weighted Linear Matroid Parity Algorithm , 2018 .

[10]  Paul D. Seymour,et al.  Packing Non-Zero A-Paths In Group-Labelled Graphs , 2006, Comb..

[11]  Lap Chi Lau,et al.  Algebraic Algorithms for Linear Matroid Parity Problems , 2011, TALG.

[12]  Yutaro Yamaguchi,et al.  MATHEMATICAL ENGINEERING TECHNICAL REPORTS Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity , 2013 .

[13]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[14]  László Lovász,et al.  On determinants, matchings, and random algorithms , 1979, FCT.

[15]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[16]  Jonathan L. Gross,et al.  Finding a maximum-genus graph imbedding , 1988, JACM.

[17]  John H. Vande Vate.  Fractional matroid matchings , 1992, J. Comb. Theory, Ser. B.

[18]  Harold N. Gabow,et al.  An augmenting path algorithm for linear matroid parity , 1986, Comb..

[19]  M. Iri,et al.  AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT" , 1976 .

[20]  John H. Vande Vate,et al.  Solving the linear matroid parity problem as a sequence of matroid intersection problems , 1990, Math. Program..

[21]  Satoru Iwata,et al.  The linear delta-matroid parity problem , 2003, J. Comb. Theory, Ser. B.

[22]  E. Lawler,et al.  Solving the Weighted Parity Problem for Gammoids by Reduction to Graphic Matching , 1982 .

[23]  László Lovász,et al.  On some combinatorial properties of algebraic matroids , 1987, Comb..

[24]  M. Milic,et al.  General passive networks-Solvability, degeneracies, and order of complexity , 1974 .

[25]  Jan Vondrák,et al.  Matroid Matching: The Power of Local Search , 2013, SIAM J. Comput..

[26]  Yutaro Yamaguchi.  Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity , 2014, SODA.

[27]  Eugene L. Lawler,et al.  Matroid intersection algorithms , 1975, Math. Program..

[28]  Satoru Iwata,et al.  Matroid Matching Via Mixed Skew-Symmetric Matrices , 2005, Comb..

[29]  László Lovász,et al.  Matroid matching and some applications , 1980, J. Comb. Theory, Ser. B.

[30]  J. Edmonds.  Matroid Intersection , 2022 .

[31]  Kazuo Murota,et al.  Matrices and Matroids for Systems Analysis , 2000 .

[32]  James B. Orlin.  A Fast, Simpler Algorithm for the Matroid Parity Problem , 2008, IPCO.

[33]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .

[34]  Bernhard Korte,et al.  Complexity of Matroid Property Algorithms , 1982, SIAM J. Comput..

[35]  Maria Chudnovsky,et al.  An algorithm for packing non-zero A-paths in group-labelled graphs , 2008, Comb..

[36]  Winfried Hochstättler,et al.  Matroid matching in pseudomodular lattices , 1989, Comb..

[37]  Nicholas J. A. Harvey.  Algebraic Algorithms for Matching and Matroid Problems , 2009, SIAM J. Comput..

[38]  Kazuo Murota,et al.  Computing the Degree of Determinants Via Combinatorial Relaxation , 1995, SIAM J. Comput..

[39]  室田 一雄,et al.  Matrices and matroids for systems analysis , 2000 .

[40]  Shin-ichi Tanigawa,et al.  Packing non-zero A-paths via matroid matching , 2016, Discret. Appl. Math..