Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case

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

Volumn 2368, Issue , 2002, Pages 150-159

  Alber, Jochen ^a   Fellows, Michael R ^b   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS;

DOMINATING SET PROBLEMS; DOMINATING SETS; LINEAR PROBLEMS; PARAMETERIZED COMPLEXITY; PLANAR GRAPH; PROBLEM KERNEL; REDUCTION RULES; UNDIRECTED GRAPH;

DATA REDUCTION;

EID: 35048860931     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_16     Document Type: Conference Paper

References (17)

1. J. Alber, H. L. Bodlaender, H. Fernau, and R. Niedermeier. Fixed parameter algorithms for planar dominating set and related problems. In Proc. 7th SWAT 2000 , Springer-Verlag LNCS 1851, pp. 97–110, 2000.
2. J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, and U. Stege. Refined search tree technique for dominating set on planar graphs. In Proc. 26th MFCS 2001 , Springer-Verlag LNCS 2136, pp. 111-122, 2001.
3. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. In Proc. 28th ICALP 2001 , Springer-Verlag LNCS 2076, pp. 261–272, 2001.
4. J. Alber, H. Fernau, and R. Niedermeier. Graph separators: a parameterized view. In Proc. 7th COCOON 2001, Springer-Verlag LNCS 2108, pp. 318–327, 2001.
5. J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229: 3–27, 2001.
6. J. Alber and R. Niedermeier. Improved tree decomposition based algorithms for domination-like problems. In Proc. 5th LATIN 2002 , Springer-Verlag LNCS 2286, pp. 613-627, 2002.
7. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25: 27–46, 1985.
8. J. Chen, I. A. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280–301, 2001.
9. R. G. Downey and M. R. Fellows. Parameterized computational feasibility. In P. Clote, J. Remmel (eds.): Feasible Mathematics II, pp. 219–244. Birkhäuser, 1995.
10. R. G. Downey and M. R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer-Verlag, 1999.
11. M. R. Fellows. Parameterized complexity: the main ideas and some research frontiers. In Proc. 12th ISAAC 2001, Springer-Verlag LNCS 2223, pp. 291–307, 2001.
12. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination inGraphs. Monographs and textbooks in pure and applied Mathematics Vol. 208, Marcel Dekker, 1998.
13. G. L. Nemhauser and L. E. Trotter. Vertex packing: structural properties and algorithms. Mathematical Programming, 8:232–248, 1975.
14. F. S. Roberts. Graph Theory and Its Applications to Problems of Society. SIAM Press 1978. Third printing 1993 by Odyssey Press.
15. J. A. Telle. Complexity of domination-type problems in graphs. Nordic J. Comput. 1:157–171, 1994.
16. K. Weihe. Covering trains by stations or the power of data reduction. In Proc. 1st ALEX’98, pp. 1–8, 1998.
17. K. Weihe. On the differences between “practical” and “applied” (invited paper). In Proc. WAE 2000 , Springer-Verlag LNCS 1982, pp. 1–10, 2001.