Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Maue, J., & Sanders, P. (2007). Engineering algorithms for approximate weighted matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4525 LNCS, pp. 242–255). Springer Verlag. https://doi.org/10.1007/978-3-540-72845-0_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
