Linear kernel for planar connected dominating set

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

Volumn 5532 LNCS, Issue , 2009, Pages 281-290

  Lokshtanov, Daniel ^a   Mnich, Matthias ^b   Saurabh, Saket ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED DOMINATING SET; INPUT GRAPHS; KERNELIZATION; LINEAR KERNEL; PLANAR GRAPH; POLYNOMIAL-TIME; REDUCTION RULES;

DATA REDUCTION; POLYNOMIAL APPROXIMATION;

SET THEORY;

EID: 67650233244     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02017-9_31     Document Type: Conference Paper

References (15)

1. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51(3), 363-384 (2004) (electronic).
2. Alon, N., Gutner, S.: Kernels for the dominating set problem on graphs with an excluded minor. Technical report, ECCC Report TR08-066 (2008).
3. Bodlaender, H.L., Penninkx, E.: A linear kernel for planar feedback vertex set. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 160-171. Springer, Heidelberg (2008).
4. Bodlaender, H.L., Penninkx, E., Tan, R.B.: A linear kernel for the k-disjoint cycle problem on planar graphs. LNCS, vol. 5369, pp. 306-317. Springer, Berlin (2008).
5. Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37(4), 1077-1106 (2007).
6. Chen, J., Kanj, I.A., Jia, W.: Vertex Cover: Further observations and further improvements. Journal of Algorithms 41(2), 280-301 (2001).
7. Demaine, E.D., Hajiaghayi, M.: Bidimensionality: new connections between FPT algorithms and PTASs. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 590-601. ACM, New York (2005) (electronic).
8. Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2n. Algorithmica 52(2), 153-166 (2008).
9. Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences. W. H. Freeman and Co., San Francisco (1979).
10. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374-387 (1998).
11. Guo, J.: Private communication (2007).
12. Guo, J., Niedermeier, R.: Linear problem kernels for NP-hard problems on planar graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 375-386. Springer, Heidelberg (2007).
13. Guo, J., Niedermeier, R., Wernicke, S.: Fixed-parameter tractability results for full-degree spanning tree and its dual. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 203-214. Springer, Heidelberg (2006).
14. Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem in planar graphs. In: Preparata, F.P., Fang, Q. (eds.) FAW 2007. LNCS, vol. 4613, pp. 325-336. Springer, Heidelberg (2007).
15. Thomassé, S.: Bidimensionality: new connections between FPT algorithms and PTASs. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 115-119. ACM, New York (2009) (electronic)