A Weighted Linear Matroid Parity Algorithm
From MaRDI portal
Publication:5149751
DOI10.1137/17M1141709zbMath1459.90181OpenAlexW3118257774MaRDI QIDQ5149751
Satoru Iwata, Yusuke Kobayashi
Publication date: 8 February 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1141709
Related Items (5)
A cost-scaling algorithm for computing the degree of determinants ⋮ A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ Combination algorithms for Steiner tree variants ⋮ A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing non-zero \(A\)-paths via matroid matching
- An algorithm for weighted fractional matroid matching
- On some combinatorial properties of algebraic matroids
- Packing non-zero \(A\)-paths in group-labelled graphs
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- An augmenting path algorithm for linear matroid parity
- Matching theory
- Matroid matching and some applications
- Über die Maximalzahl kreuzungsfreier H-Wege
- The linear delta-matroid parity problem
- Matroid matching in pseudomodular lattices
- Fractional matroid matchings
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Packing non-returning A-paths
- Matroid matching via mixed skew-symmetric matrices
- Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity
- Algebraic Algorithms for Linear Matroid Parity Problems
- Matroid Matching: The Power of Local Search
- Matroid Intersection
- A Fast, Simpler Algorithm for the Matroid Parity Problem
- Algebraic Algorithms for Matching and Matroid Problems
- Complexity of Matroid Property Algorithms
- Random pseudo-polynomial algorithms for exact matroid problems
- Matroid intersection algorithms
- AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity
- Computing the Degree of Determinants via Combinatorial Relaxation
- Paths, Trees, and Flowers
- Steiner Tree Approximation via Iterative Randomized Rounding
- Maximum matching and a polyhedron with 0,1-vertices
- The Factorization of Linear Graphs
- Matrices and matroids for systems analysis
This page was built for publication: A Weighted Linear Matroid Parity Algorithm
