Abstract
We study the worst-case performance of the maximal matching heuristic applied to the MINIMUM VERTEX COVER and MINIMUM MAXIMAL MATCHING problems, through a careful analysis of tight examples. We show that the tight worst-case approximation ratio is asymptotic to min{2,1/(1 - √1 - ε)} for graphs with an average degree at least εn and to min{2,1/ε} for graphs with a minimum degree at least εn. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
APA
Cardinal, J., Labbé, M., Langerman, S., Levy, E., & Mélot, H. (2005). A tight analysis of the maximal matching heuristic. In Lecture Notes in Computer Science (Vol. 3595, pp. 701–709). Springer Verlag. https://doi.org/10.1007/11533719_71
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free