Linear time local improvements for weighted matchings in graphs

  • Authors:

  • Doratha E. Drake;Stefan Hougardy

  • Affiliations:

  • Institut für Informatik, Humboldt-Universität zu Berlin, Berlin, Germany;Institut für Informatik, Humboldt-Universität zu Berlin, Berlin, Germany

  • Venue:
  • WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently two different linear time approximation algorithms for the weighted matching problem in graphs have been suggested [5][17]. Both these algorithms have a performance ratio of 1/2. In this paper we present a set of local improvement operations and prove that it guarantees a performance ratio of 2/3. We showt hat a maximal set of these local improvements can be found in linear time. To see howthe se local improvements behave in practice we conduct an experimental comparison of four different approximation algorithms for calculating maximum weight matchings in weighted graphs. One of these algorithms is the commonly used Greedy algorithm which achieves a performance ratio of 1/2 but has O(mlog n) runtime. The other three algorithms all have linear runtime. Two of them are the above mentioned 1/2 approximation algorithms. The third algorithm may have an arbitrarily bad performance ratio but in practice produces reasonably good results. We compare the quality of the algorithms on a test set of weighted graphs and study the improvement achieved by our local improvement operations. We also do a comparison of the runtimes of all algorithms.