A Simple Approximation Algorithm for the Weighted Matching Problem (2003)
Cached
Download Links
- [www.informatik.hu-berlin.de]
- [www.eecs.umich.edu]
- DBLP
Other Repositories/Bibliography
by
Doratha E. Drake
,
Stefan Hougardy
| Venue: | Information Processing Letters |
| Citations: | 21 - 3 self |
BibTeX
@ARTICLE{Drake03asimple,
author = {Doratha E. Drake and Stefan Hougardy},
title = {A Simple Approximation Algorithm for the Weighted Matching Problem},
journal = {Information Processing Letters},
year = {2003},
volume = {85},
pages = {211--213}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a linear time approximation algorithm with a performance ratio of 1/2 for nding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [7].
