Proceedings of 37th Conference on Foundations of Computer Science (1996)
Oct. 14, 1996 to Oct. 16, 1996
W.H. Cunningham , Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada
J.F. Geelen , Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada
We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we present results implying the polynomial-time solvability of the two problems. We also use our results to give the first strongly polynomial separation algorithm for the convex hull of matchable sets of a graph, and the first polynomial-time algorithm to compute the rank of a certain matrix of indeterminates. Our algorithmic results are based on polyhedral characterizations, and on the equivalence of separation and optimization.
matrix algebra; generalization; path-matching; weighted matroid intersection; polynomial-time solvability; convex hull; polynomial-time algorithm; equivalence; separation; optimization
J. Geelen and W. Cunningham, "The optimal path-matching problem," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 78.