Abstract
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 \(\epsilon \binom{n}{2}\) edges, for ε> 1/2. This ratio is shown to be asymptotically tight for ε> 1/2.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cardinal, J., Labbé, M., Langerman, S., Levy, E., Mélot, H.: A tight analysis of the maximal matching heuristic. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 701–709. Springer, Heidelberg (2005)
Carr, R., Fujito, T., Konjevod, G., Parekh, O.: A 2 1/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. Journal of Combinatorial Optimization 5, 317–326 (2001)
Chlebìk, M., Chlebìkovà, J.: Approximation hardness of edge dominating set problems. Journal of Combinatorial Optimization 11(3), 279–290 (2006)
Eremeev, A.V.: On some approximation algorithms for dense vertex cover problem. In: Proc. of SOR, pp. 58–62. Springer, Heidelberg (1999)
Fujito, T., Nagamochi, H.: A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Appl. Math. 118, 199–207 (2002)
Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. Freeman and Company, New York (1979)
Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. Siam Journal on Computing 31, 1608–1623 (2002)
Horton, J.D., Kilakos, K.: Minimum edge dominating sets. SIAM J. Discrete Math. 6, 375–387 (1993)
Imamura, T., Iwama, K.: Approximating vertex cover on dense graphs. In: Proc. of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 582–589 (2005)
Karpinski, M., Zelikovsky, A.: Approximating dense cases of covering problems. In: Pardalos, P., Du, D. (eds.) Proc. of the DIMACS Workshop on Network Design: Connectivity and Facilites Location. DIMACS series in Disc. Math. and Theor. Comp. Sci., vol. 40, pp. 169–178 (1997)
Mélot, H.: Facets Defining Inequalities among Graph Invariants: the system GraPHedron (2005) (Submitted)
Srinivasan, A., Madhukar, K., Navagamsi, P., Pandu Rangan, C., Chang, M.-S.: Edge domination on bipartite permutation graphs and cotriangulated graphs. Inf. Proc. Letters 56, 165–171 (1995)
Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3), 364–372 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cardinal, J., Langerman, S., Levy, E. (2007). Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. In: Erlebach, T., Kaklamanis, C. (eds) Approximation and Online Algorithms. WAOA 2006. Lecture Notes in Computer Science, vol 4368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11970125_9
Download citation
DOI: https://doi.org/10.1007/11970125_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69513-4
Online ISBN: 978-3-540-69514-1
eBook Packages: Computer ScienceComputer Science (R0)