论文信息 - Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs

Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs

A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is presented. It calculates a matching with an edge weight of at least 1/2 of the edge weight of a maximum weighted matching. Its time complexity is O(|E|), with |E| being the number of edges in the graph. This improves over the previously known 1/2 -approximation algorithms for maximum weighted matching which require O(|E| ċ log(|V|)) steps, where |V| is the number of vertices.

Robert Preis | R. Preis

[1] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[2] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[3] 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).

[4] David Avis,et al. A survey of heuristics for the weighted matching problem , 1983, Networks.

[5] L. Lovász. Matching Theory (North-Holland mathematics studies) , 1986 .

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

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

[8] Ralf Diekmann,et al. The PARTY Partitioning Library User Guide - Version 1.1 , 1996 .

[9] Wojciech Rytter,et al. Fast parallel algorithms for graph matching problems , 1998 .