Skip to content

Improved linear time approximation algorithms for weighted matchings

Citations of this article
Mendeley users who have this article in their library.
Get full text


The weighted matching problem is to find a matching in a weighted graph that has maximum weight. The fastest known algorithm for this problem has running time O(nm + n2 log n). Many real world problems require graphs of such large size that this running time is too costly. We present a linear time approximation algorithm for the weighted matching problem with a performance ratio of 2/3-ε. This improves the previously best performance ratio of 1/2. © Springer-Verlag Berlin Heidelberg 2003.




Drake, D. E., & Hougardy, S. (2003). Improved linear time approximation algorithms for weighted matchings. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2764, 14–23.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free