The optimal path-matching problem
Conference
·
OSTI ID:457639
- Univ. of Waterloo, Ontario (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.
- OSTI ID:
- 457639
- Report Number(s):
- CONF-961004-; TRN: 97:001036-0010
- Resource Relation:
- Conference: 37. annual symposium on foundations of computer science, Burlington, VT (United States), 13-16 Oct 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the 37th annual symposium on foundations of computer science; PB: 656 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Post matching - a distributive analog of independent matching
General models in min-max planar location
Quantum Matching Theory (with new complexity-theoretic, combinatorial and topical insights on the nature of the quantum entanglement)
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:457639
General models in min-max planar location
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:457639
Quantum Matching Theory (with new complexity-theoretic, combinatorial and topical insights on the nature of the quantum entanglement)
Conference
·
Tue Jan 01 00:00:00 EST 2002
·
OSTI ID:457639