Engineering Algorithms for Approximate Weighted Matching

We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a recent path heuristic. Surprisingly, this quite simple algorithm performs very well, both in terms of running time and solution quality, and, though some other methods have a better theoretical performance, it ranks among the best algorithms.

• Type: Conference
• Year: 2007
• Where: WEA
• Authors: Jens Maue, Peter Sanders
• Keywords: Algorithms, Simple Algorithm Performs, Simple Greedy Method, WEA 2007, Weight Matching Problem