A Generalization of Edmonds' Matching and Matroid Intersection Algorithms

Authors:
Bianca Spille;Robert Weismantel
Affiliations:
-;-
Venue:
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2002

Citing 0
Cited 3

A combinatorial algorithm for computing a maximum independent set in a t-perfect graph

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The independent even factor problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial algorithm to find a maximum even factor

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The independent path-matching problem is a common generalization of the matching problem and the matroid intersection problem. Cunningham and Geelen proved that this problem is solvable in polynomial time via the ellipsoid method. We present a polynomial-time combinatorial algorithm for its unweighted version that generalizes the known combinatorial algorithms for the cardinality matching problem and the matroid intersection problem.