A simple approximation algorithm for the weighted matching problem
- 28 February 2003
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 85 (4), 211-213
- https://doi.org/10.1016/s0020-0190(02)00393-9
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Quality matching and local improvement for multilevel graph-partitioningParallel Computing, 2000
- Complexity and Modeling Aspects of Mesh Refinement into QuadrilateralsAlgorithmica, 2000
- Computing Minimum-Weight Perfect MatchingsINFORMS Journal on Computing, 1999
- A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithmCombinatorica, 1994
- Faster scaling algorithms for general graph matching problemsJournal of the ACM, 1991