A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs

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

Volumn 3153, Issue , 2004, Pages 488-499

  Fernau, Henning ^a,b   Juedes, David ^c  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c OHIO UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; GRAPH THEORY; GRAPHIC METHODS; PARAMETER ESTIMATION; PARAMETERIZATION;

DESIGN AND ANALYSIS; EDGE DOMINATING SET; FIXED-PARAMETER ALGORITHMS; GEOMETRIC APPROACHES; GEOMETRIC ARGUMENTS; PARAMETERIZED ALGORITHM; PLANAR DOMINATING SET; PLANAR VERTEX COVER;

ALGORITHMS;

EID: 21144445529     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_37     Document Type: Article

References (14)

1. 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:461-493, 2002.
2. J. Alber, H. L. Bodlaender, H. Fernau, and R. Niedermeier. Fixed-parameterized algorithms for planar dominating set and related problems. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory SWAT, volume 1851 of LNCS, pages 97-110. Springer, 2000.
3. J. Alber, H. Fan, M. Fellows, H. Fernau, and R. Niedermeier. Refined search tree technique for dominating set on planar graphs. In Proceedings of the 25th International Symposium on the Mathematical Foundations of Computer Science MFCS, volume 2136 of LNCS, pages 111-122. Springer, 2000.
4. J. Alber, M. R. Fellows, and R. Niedermeier. Efficient data reduction for dominating set: A linear problem kernel for the planar case. In Proceedings of the 8th Scandinavian Workshop on Algorithm Theory SWAT, volume 2368 of LNCS, pages 150-159. Springer, 2002.
5. L. Cai, M. R. Fellows, D. Juedes, and F. Rosamond. On efficient polynomial-time approximation schemes for problems on planar structures, 2001. Manuscript. Some of these results appear in [8].
6. 5-minor-free graphs. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation ISAAC, volume 2518 of LNCS, pages 262-273. Springer, 2002.
7. R. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
8. M. R. Fellows. Parameterized complexity: the main ideas, connections to heuristics and research frontiers. In Proceedings of the 12th International Symposium on Algorithms and Computation ISAAC, volume 2223 of LNCS, pages 291-307. Springer, 2001.
9. F. V. Fomin and D. Thilikos. Dominating sets in planar graphs: Branch-width and exponential speed-up. In Proceedings of the 14th Annual Symposium on Discrete Algorithms SODA, pages 168-177. ACM Press, 2003.
10. M. R. Garey and D. S. Johnson. Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman, 1979.
11. I. A. Kanj and L. Perkovič. Improved parameterized algorithms for planar dominating set. In Proceedings of the 27th International Symposium on the Mathematical Foundations of Computer Science MFCS, volume 2420 of LNCS, pages 399-410. Springer, 2002.
12. S. Khanna and R. Motwani. Toward a syntactic characterization of PTAS. In Proceedings of the 28th Annual Symposium on Theory of Computing STOC, pages 329-337. ACM Press, 1996.
13. T. Kloks, C. M. Lee, and J. Liu. New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. In Proceedings of the 28th Workshop on Graph-Theoretic Concepts in Computer Science WG, volume 2573 of LNCS, pages 282-295. Springer, 2002.
14. M. Thorup. Structural programs have small tree-width and good register allocation. In Proceedings of the 23rd Workshop on Graph-Theoretic Concepts in Computer Science WG, volume 1335 of LNCS, pages 318-332. Springer, 1997.