EDGE DOMINATING SET: Efficient enumeration-based exact algorithms

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

Volumn 4169 LNCS, Issue , 2006, Pages 142-153

  Fernau, Henning ^a,b  

^a UNIVERSITY OF TRIER   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; PROBLEM SOLVING; THEOREM PROVING;

COMPACT REPRESENTATIONS; DECISION ALGORITHMS;

SET THEORY;

EID: 33750248201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_13     Document Type: Conference Paper

References (23)

1. V. Bafna, P. Berman, and T. Fujito. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal of Discrete Mathematics, 12:289-297, 1999.
2. A. Berger and O. Parekh. Linear time algorithms for generalized edge dominating set problems. Technical Report TR-2005-002-A, Emory University Math/CS department, 2005.
3. 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.
4. P. Damaschke. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. In R. Downey, M. Fellows, and F. Dehne, editors. International Workshop on Parameterized and Exact Computation IWPEC 8004, volume 3162 of LNCS, pages 1-12. Springer, 2004.
5. 3) fpt algorithm for the undirected feedback vertex set problem. In Proc. 11th International Computing and Combinatorics Conference COCOON, volume 3595 of LNCS, pages 859-869. Springer, 2005.
6. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
7. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45:634-652, 1998.
8. M. R. Fellows, C. McCartin, F. A. Rosamond, and U. Stege. Coordinatized kernels and catalytic reductions: an improved FPT algorithm for Max Leaf Spanning Tree and other problems. In S. Kapoor and S. Prasad, editors, FST TCS 2000, volume 1974 of LNCS, pages 240-251. Springer, 2000.
9. H. Fernau. On parameterized enumeration. In O. H. Ibarra and L. Zhang, editors, Computing and Combinatorics, Proceedings COCOON 2002, volume 2383 of LNCS, pages 564-573. Springer, 2002.
10. H. Fernau and D. F. Manlove. Vertex and edge covers with clustering properties: Complexity and algorithms. Technical Report TR-2006-210, Department of Computing Science DCS Glasgow, UK, April 2006. Available through: http://www.dcs.gla.ac.uk/publications/paperdetails.cfm?id=8137.
11. H. Fernau and R. Niedermeier. An efficient exact algorithm for constraint bipartite vertex cover. Journal of Algorithms, 38(2):374-410, 2001.
12. F. Fomin, D. Kratsch, and G. Woeginger. Exact (exponential) algorithms for the dominating set problem. In J. Hromkovic et al., editors, 30th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2004, volume 3353 of LNCS, pages 245-256. Springer, 2004.
13. T. Fujito and H. Nagamochi. A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics, 118:199-207, 2002.
14. J. Guo, J. Gramm, F. Hüffner, R. Niedermeier, and S. Wernicke. Improved fixed-parameter algorithms for two feedback set problems. In Proceedings of the 9th Workshop on Algorithms and Data Structures WADS, volume 3608 of LNCS, pages 158-168. Springer, 2005.
15. J. D. Horton and K. Kilakos. Minimum edge dominating sets. SIAM Journal of Discrete Mathematics, 6:375-387, 1993.
16. C. L. Lu, M.-T. Ko, and C. Y. Tang. Perfect edge domination and efficient edge domination in graphs. Discrete Applied Mathematics, 119(3):227-250, 2002.
17. D. F. Manlove. Minimaximal and maximinimal optimisation problems: a partial order-based approach. PhD thesis, University of Glasgow, Computing Science, 1998.
18. O. Parekh. Edge domination and hypomatchable sets. In Symposium on Discrete Algorithms SODA 2002, pages 287-291. ACM Press, 2002.
19. J. Plesník. Equivalence between the minimum covering problem and the maximum matching problem. Discrete Mathematics, 49:315-317, 1984.
20. J. Plesník. Constrained weighted matchings and edge coverings in graphs. Discrete Applied Mathematics, 92:229-241, 1999.
21. E. Prieto. Systematic Kernelization in FPT Algorithm Design. PhD thesis, The University of Newcastle, Australia, 2005.
22. M. Weston. A fixed-parameter tractable algorithm for matrix domination. Information Processing Letters, 90:267-272, 2004.
23. M. Yannakakis and F. Gavril. Edge dominating sets in graphs. SIAM Journal of Applied Mathematics, 38(3):364-372, June 1980.