Sciweavers

WEA
2007
Springer

Engineering Algorithms for Approximate Weighted Matching

14 years 5 months ago
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.
Jens Maue, Peter Sanders
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where WEA
Authors Jens Maue, Peter Sanders
Comments (0)