par Cardinal, Jean 
;Langerman, Stefan ;Levy, Eythan
Référence Theoretical computer science, 410, 8-10, page (949-957)
Publication Publié, 2009-03
;Langerman, Stefan ;Levy, Eythan Référence Theoretical computer science, 410, 8-10, page (949-957)
Publication Publié, 2009-03
Article révisé par les pairs
| Résumé : | We analyze the simple greedy algorithm that iteratively removes the endpoints of a maximum-degree edge in a graph, where the degree of an edge is the sum of the degrees of its endpoints. This algorithm provides a 2-approximation to the minimum edge dominating set and minimum maximal matching problems. We refine its analysis and give an expression of the approximation ratio that is strictly less than 2 in the cases where the input graph has n vertices and at least ε{lunate} (frac(n, 2)) edges, for ε{lunate} > 1 / 2. This ratio is shown to be asymptotically tight for ε{lunate} > 1 / 2. © 2009 Elsevier B.V. All rights reserved. |
