Improved approximation bounds for edge dominating set in dense graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4368 LNCS, Issue , 2007, Pages 108-120

  Cardinal, Jean ^a   Langerman, Stefan ^a   Levy, Eythan ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING;

APPROXIMATION BOUNDS; DENSE GRAPHS; MAXIMAL MATCHING PROBLEMS;

SET THEORY;

EID: 38149038706     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11970125_9     Document Type: Conference Paper

References (13)

1. J. Cardinal, M. Labbé, S. Langerman, E. Levy, and H. Mélot. A tight analysis of the maximal matching heuristic. In Proc. of The Eleventh International Computing and Combinatorics Conference (COCOON), LNCS, pages 701-709. Springer-Verlag, 2005.
2. R. Carr, T. Fujito, G. Konjevod, and O. Parekh. A 2 1/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. Journal of Combinatorial Optimization, 5:317-326, 2001.
3. M. Chlebík and J. Chlebìkovà. Approximation hardness of edge dominating set problems. Journal of Combinatorial Optimization, 11(3):279-290, 2006.
4. A.V. Eremeev. On some approximation algorithms for dense vertex cover problem. In Proc. of SOR, pages 58-62. Springer-Verlag, 1999.
5. T. Fujito and H. Nagamochi. A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Appl. Math., 118:199-207, 2002.
6. M. R. Garey and D. S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. Freeman and Company, 1979.
7. E. Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. Siam Journal on Computing, 31:1608-1623, 2002.
8. J.D. Horton and K. Kilakos. Minimum edge dominating sets. SIAM J. Discrete Math., 6:375-387, 1993.
9. T. Imamura and K. Iwama. Approximating vertex cover on dense graphs. In Proc. of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 582-589, 2005.
10. M. Karpinski and A. Zelikovsky. Approximating dense cases of covering problems. In P. Pardalos and D. Du, editors, Proc. of the DIMACS Workshop on Network Design: Connectivity and Facilites Location, volume 40 of DIMACS series in Disc. Math. and Theor. Comp. Sci., pages 169-178, 1997.
11. H. Mélot. Facets Defining Inequalities among Graph Invariants: the system GraPHedron. Submitted, 2005.
12. A. Srinivasan, K. Madhukar, P. Navagamsi, C. Pandu Rangan, and M.-S. Chang. Edge domination on bipartite permutation graphs and cotriangulated graphs. Inf. Proc. Letters, 56:165-171, 1995.
13. M. Yannakakis and F. Gavril. Edge dominating sets in graphs. SIAM J. Appl. Math., 38(3):364-372, 1980.