Improved parameterized algorithms for planar dominating set

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

Volumn 2420, Issue , 2002, Pages 399-410

  Kanj, Iyad A ^a   Perković, Ljubomir ^a  

^a DEPAUL UNIVERSITY   (United States)

Author keywords

NP complete problems; Parameterized algorithms; Planar dominating set

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PARAMETERIZATION;

DOMINATING SETS; PARAMETERIZED ALGORITHM; PLANAR DOMINATING SET; PLANAR GRAPH; POSITIVE INTEGERS; TIME COMPLEXITY;

PARAMETER ESTIMATION;

EID: 84956994784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_33     Document Type: Conference Paper

References (11)

1. J. Alber, H. L. Bodlaender, H. Ferneau, and R. Niedermeier, Fixed parameter algorithms for Dominating Set and related problems on planar graphs, To appear in Algorithmica (2002). Earlier version appeared in LNCS 1851, (2000), pp. 97-110.
2. J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, and U. Stege, Refined search tree techniques for Dominating Set on planar graphs, in LNCS 2136, (2001), pp. 111-122.
3. J. Alber, H. Fernau, and R. Niedermeier, Parameterized complexity: Exponential speed-up for planar graph problems, in LNCS 2076, (2001), pp. 261-272.
4. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM 41, (1994), pp. 153-180.
5. N. Bansal and V. Raman, Upper bounds for Max-Sat further improved, LNCS 1741, (1999), pp. 247-258.
6. L. Cai and D. Juedes, On the existence of sub exponential-time parameterized algorithms, available at http://www.cs.uga.edu/˜cai/.
7. J. Chen, and I. A. Kanj, Improved exact algorithms for Max-Sat, in LNCS 2286, (2002).
8. J. Chen, I. A. Kanj, and W. Jia, Vertex cover: further observations and further improvement, Journal of Algorithms 41, (2001), pp. 280-301.
9. R. G. Downey and M. R. Fellows, Parameterized Complexity, New York, New York: Springer, (1999).
10. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
11. R. Niedermeier and P. Rossmanith, Upper bounds for vertex cover further improved, in LNCS 1563, (1999), pp. 561-570.