A refined search tree technique for Dominating Set on planar graphs

Journal of Computer and System Sciences

Volumn 71, Issue 4, 2005, Pages 385-405

  Alber, Jochen ^a   Fan, Hongbing ^b   Fellows, Michael R ^c   Fernau, Henning ^a,c   Niedermeier, Rolf ^a   Rosamond, Fran ^c   Stege, Ulrike ^d  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF LETHBRIDGE   (Canada)

^c UNIVERSITY OF NEWCASTLE   (Australia)

^d UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Dominating set; Exact algorithm; Fixed parameter tractability; NP complete problem; Planar graph; Search tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; GRAPH THEORY; POLYNOMIALS; SET THEORY; THEOREM PROVING;

DOMINATING SET; EXACT ALGORITHM; FIXED-PARAMETER TRACTABILITY; PLANAR GRAPH; SEARCH TREE;

TREES (MATHEMATICS);

EID: 27344446501     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.03.007     Document Type: Article

References (29)

1. J. Alber, Exact Algorithms for NP-hard Problems on Networks: Design, Analysis, and Implementation, Ph.D. Thesis, Universität Tübingen, Germany, January 2003.
2. J. Alber, N. Betzler, and R. Niedermeier Experiments on data reduction for optimal domination in networks Proceedings International Network Optimization Conference 2003 Evry/Paris, France October 2003 1 6
3. J. Alber, H.L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier Fixed parameter algorithms for dominating set and related problems on planar graphs Algorithmica 33 4 2002 461 493
4. J. Alber, M.R. Fellows, and R. Niedermeier Polynomial-time data reduction for Dominating Set J. ACM 51 3 2004 363 384
5. J. Alber, H. Fernau, and R. Niedermeier Graph separators a parameterized view J. Comput. System Sci. 67 4 2003 808 832
6. J. Alber, H. Fernau, and R. Niedermeier Parameterized complexity: exponential speedup for planar graph problems J. Algorithms 52 1 2004 26 56
7. B.S. Baker Approximation algorithms for NP-complete problems on planar graphs J. ACM 41 1 1994 153 180
8. J. Chen, I.A. Kanj, and W. Jia Vertex cover further observations and further improvements J. Algorithms 41 2001 280 301
9. E.D. Demaine, F.V. Fomin, M. Taghi Hajiaghayi, D.M. Thilikos, Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs, in: 30th International Colloquium on Automata, Languages and Programming 2003, Lecture Notes in Computer Science, vol. 2719, Springer, Berlin, 2003, pp. 829-844.
10. E.D. Demaine, F.V. Fomin, M. Taghi Hajiaghayi, D.M. Thilikos, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. 15th ACM-SIAM Symposium on Discrete Algorithms 2004, 2004, pp. 830-839.
11. E.D. Demaine, F.V. Fomin, M. Taghi Hajiaghayi, D.M. Thilikos, Bidimensional parameters and local treewidth. Latin American Theoretical Informatics 2004, Lecture Notes in Computer Science, vol. 2976, Springer, Berlin, 2004, pp. 109-118.
12. Long version to appear in SIAM J. Disc. Math.
13. E.D. Demaine, M. Taghi Hajiaghayi, D.M. Thilikos, Exponential speedup of fixed-parameter algorithms on K 3,3 -minor-free or K 5 -minor-free graphs, in: 13th Annual International Symposium on Algorithms and Computation 2002, Lecture Notes in Computer Science, vol. 2518, Springer, Berlin, 2002, pp. 262-273.
14. R. Diestel Graph Theory 2nd ed. 2000 Springer Berlin
15. R.G. Downey, and M.R. Fellows Parameterized computational feasibility P. Clote J. Remmel Feasible Mathematics II 1995 Birkhäuser Basel 219 244
16. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer Berlin
17. R.G. Downey, M.R. Fellows, U. Stege, Parameterized complexity: a framework for systematically confronting computational intractability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, 1999, pp. 49-99.
18. J. Ellis, H. Fan, M.R. Fellows, The dominating set problem is fixed parameter tractable for graphs of bounded genus, J. Algorithms 52 (2) (2004) 152-168.
19. U. Feige A threshold of ln n for approximating set cover J. ACM 45 1998 634 652
20. F.V. Fomin, and D.T. Thilikos Dominating sets in planar graphs branch-width and exponential speed-up 14th ACM-SIAM Symposium on Discrete Algorithms 2003 2003 168 177
21. F.V. Fomin, D.T. Thilikos, Dominating sets and local treewidth, in: 11th European Symposium on Algorithms 2003, Lecture Notes in Computer Science, vol. 2832, Springer, Berlin, 2003, pp. 221-229.
22. F.V. Fomin, D.T. Thilikos, A simple and fast approach for solving problems on planar graphs, 21st International Symposium on Theoretical Aspects of Computer Science 2004, Lecture Notes in Computer Science, vol. 2996, Springer, Berlin, 2004, pp. 56-67.
23. M.R. Garey, and D.S. Johnson Computers and Intractability A Guide to the Theory of NP-completeness 1979 Freeman New York
24. T.W. Haynes, S.T. Hedetniemi, and P.J. Slater Fundamentals of Domination in Graphs Monographs, and Textbooks in Pure and Applied Mathematics vol. 208 1998 Marcel Dekker New York
25. T.W. Haynes, S.T. Hedetniemi, P.J. Slater (Eds.), Domination in Graphs, Monographs and Textbooks in Pure and Applied Mathematics, vol. 209, Marcel Dekker, New York, 1998.
26. R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover further improved, in: 16th International Symposium on Theoretical Aspects of Computer Science STACS 1999, Lecture Notes in Computer Science, vol. 1563, Springer, Berlin, 1999, pp. 561-570.
27. R. Niedermeier, and P. Rossmanith A general method to speed up fixed-parameter-tractable algorithms Inform. Process. Lett. 73 3-4 2000 125 129
28. R. Niedermeier, and P. Rossmanith On efficient fixed-parameter algorithms for weighted vertex cover J. Algorithms 47 2 2003 63 77
29. D.B. West Introduction to Graph Theory 2nd ed. 2001 Prentice-Hall Englewood Cliffs, NJ