Skip to main content
Conference Proceedings

Linear time ½ -approximation algorithm for maximum weighted matching in general graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1563 259-269
DOI: 10.1007/3-540-49116-3_24
146Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 ½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 ½ -approximation algorithms for maximum weighted matching which require O(|E| _ log(|V |)) steps, where |V | is the number of vertices.

Cite

CITATION STYLE

APA

Preis, R. (1999). Linear time ½ -approximation algorithm for maximum weighted matching in general graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1563, pp. 259–269). Springer Verlag. https://doi.org/10.1007/3-540-49116-3_24

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