Advertisement

Linear Kernel for Planar Connected Dominating Set

  • Daniel Lokshtanov
  • Matthias Mnich
  • Saket Saurabh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5532)

Abstract

We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set problem. To obtain the desired kernel we introduce a method that we call reduce or refine. Our kernelization algorithm analyzes the input graph and either finds an appropriate reduction rule that can be applied, or zooms in on a region of the graph which is more amenable to reduction. We find this method of independent interest and believe that it will be useful to obtain linear kernels for other problems on planar graphs.

Keywords

Planar Graph Vertex Cover Linear Kernel Kernel Size Reduction Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51(3), 363–384 (2004) (electronic)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Alon, N., Gutner, S.: Kernels for the dominating set problem on graphs with an excluded minor. Technical report, ECCC Report TR08-066 (2008)Google Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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)Google Scholar
  5. 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)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chen, J., Kanj, I.A., Jia, W.: Vertex Cover: Further observations and further improvements. Journal of Algorithms 41(2), 280–301 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 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)Google Scholar
  8. 8.
    Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2n. Algorithmica 52(2), 153–166 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 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)zbMATHGoogle Scholar
  10. 10.
    Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Guo, J.: Private communication (2007)Google Scholar
  12. 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)CrossRefGoogle Scholar
  13. 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)CrossRefGoogle Scholar
  14. 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)CrossRefGoogle Scholar
  15. 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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Daniel Lokshtanov
    • 1
  • Matthias Mnich
    • 2
  • Saket Saurabh
    • 1
  1. 1.Institutt for InformatikkUniversitetet i BergenBergenNorway
  2. 2.Faculteit Wiskunde en InformaticaTechnische Universiteit EindhovenEindhovenThe Netherlands

Personalised recommendations