论文信息 - A simple approximation algorithm for the weighted matching problem

A simple approximation algorithm for the weighted matching problem

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time.

Stefan Hougardy | Doratha E. Drake Vinkemeier | S. Hougardy | D. Vinkemeier

[1] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[2] William J. Cook,et al. Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..

[3] Ralf Diekmann,et al. Quality matching and local improvement for multilevel graph-partitioning , 2000, Parallel Comput..

[4] Rolf H. Möhring,et al. Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals , 1997, Algorithmica.

[5] Robert Preis,et al. Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs , 1999, STACS.

[6] Vijay V. Vazirani,et al. A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm , 1990, Comb..

[7] Robert E. Tarjan,et al. Faster scaling algorithms for general graph matching problems , 1991, JACM.

[8] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).