An augmenting path algorithm for linear matroid parity
Combinatorica
Finding a maximum-genus graph imbedding
Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Solving the linear matroid parity problem as a sequence of matroid intersection problems
Mathematical Programming: Series A and B
Random pseudo-polynomial algorithms for exact matroid problems
Journal of Algorithms
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
SIAM Journal on Discrete Mathematics
The membership problem in jump systems
Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
A better approximation algorithm for finding planar subgraphs
Journal of Algorithms
Introduction to Algorithms
Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
RNC-Approximation Algorithms for the Steiner Problem
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
On the graphic matroid parity problem
Journal of Combinatorial Theory Series B
High-order lifting and integrality certification
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Maximum Matchings via Gaussian Elimination
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Matroid Matching Via Mixed Skew-Symmetric Matrices
Combinatorica
Some new results on node-capacitated packing of A-paths
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Packing Non-Returning A-Paths*
Combinatorica
An algebraic algorithm for weighted linear matroid intersection
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for independent assignment on graphic and linear matroids
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Matchings, matroids and submodular functions
Matchings, matroids and submodular functions
Algebraic Algorithms for Matching and Matroid Problems
SIAM Journal on Computing
A Fast Algorithm for the Path 2-Packing Problem
Theory of Computing Systems - Special Issue: Symposium on Computer Science, Guest Editors: Sergei Artemov, Volker Diekert and Dima Grigoriev
A fast, simpler algorithm for the matroid parity problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing
Matrices and Matroids for Systems Analysis
Matrices and Matroids for Systems Analysis
Applications of the linear matroid parity algorithm to approximating steiner trees
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Matching problems with delta-matroid constraints
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
Hi-index | 0.00 |
We present fast and simple algebraic algorithms for the linear matroid parity problem and its applications. For the linear matroid parity problem, we obtain a simple randomized algorithm with running time O(mrω−1) where m and r are the number of columns and the number of rows and ω ≈ 2.376 is the matrix multiplication exponent. This improves the O(mrω)-time algorithm by Gabow and Stallmann, and matches the running time of the algebraic algorithm for linear matroid intersection, answering a question of Harvey. We also present a very simple alternative algorithm with running time O(mr2) which does not need fast matrix multiplication. We further improve the algebraic algorithms for some specific graph problems of interest. For the Mader's disjoint S-path problem, we present an O(nω)-time randomized algorithm where n is the number of vertices. This improves the running time of the existing results considerably, and matches the running time of the algebraic algorithms for graph matching. For the graphic matroid parity problem, we give an O(n4)-time randomized algorithm where n is the number of vertices, and an O(n3)-time randomized algorithm for a special case useful in designing approximation algorithms. These algorithms are optimal in terms of n as the input size could be Ω(n4) and Ω(n3) respectively. The techniques are based on the algebraic algorithmic framework developed by Mucha and Sankowski, Harvey, and Sankowski. While linear matroid parity and Mader's disjoint S-path are challenging generalizations for the design of combinatorial algorithms, our results show that both the algebraic algorithms for linear matroid intersection and graph matching can be extended nicely to more general settings. All algorithms are still faster than the existing algorithms even if fast matrix multiplication is not used. These provide simple algorithms that can be easily implemented in practice.