A simple approximation algorithm for the weighted matching problem

Information Processing Letters

Volumn 85, Issue 4, 2003, Pages 211-213

  Drake, Doratha E ^a   Hougardy, Stefan ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Analysis of algorithms; Approximation algorithms; Graph algorithms; Maximum weight matching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; THEOREM PROVING;

GRAPH ALGORITHMS;

GRAPH THEORY;

EID: 0037469753     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00393-9     Document Type: Article

References (8)

1. Cook W., Rohe A. Computing minimum-weight perfect matchings. INFORMS J. Comput. 11:1999;138-148.
2. Gabow H.N. Data structures for weighted matching and nearest common ancestors with linking. Proc. SODA'90. 1990;434-443.
3. Gabow H.N., Tarjan R.E. Faster scaling algorithms for general graph-matching problems. J. ACM. 38:(4):1991;815-853.
4. Micali S., Vazirani V.V. An O( √V E) algorithm for finding maximum matching in general graphs. Proc. 21st Annual IEEE Symposium on Foundations of Computer Science. 1980;17-27.
5. Möhring R.H., Müller-Hannemann M. Complexity and modeling aspects of mesh refinement into quadrilaterals. Algorithmica. 26:2000;148-171.
6. Monien B., Preis R., Diekmann R. Quality matching and local improvement for multilevel graph-partitioning. Parallel Comput. 26:(12):2000;1609-1634.
7. Preis R. Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs. Meinel C., Tison S. Symposium on Theoretical Aspects of Computer Science, STACS 99. Lecture Notes in Comput. Sci. 1563:1999;259-269 Springer, Berlin.
8. Vazirani V.V. A theory of alternating paths and blossoms for proving correctness of the O( √V E) maximum matching algorithm. Combinatorica. 14:(1):1994;71-109.