Improved linear problem kernel for planar connected dominating set

In this paper, we study the Planar Connected Dominating Set problem, which, given a planar graph G=(V,E) and a non-negative integer k, asks for a subset [email protected]?V with |D|@?k such that D forms a dominating set of G and induces a connected graph. Answering an open question posed at the 2nd Workshop on Kernelization (WorKer 2010), we provide a kernelization algorithm for this problem, leading to a problem kernel with at most 130k vertices, improving the previously best upper bound on the kernel size. To this end, we incorporate a vertex coloring technique with data reduction rules and introduce a type distinction of regions into the region decomposition framework, which allows a refined analysis of the region size.

[1]  Rolf Niedermeier,et al.  Linear Problem Kernels for NP-Hard Problems on Planar Graphs , 2007, ICALP.

[2]  Weili Wu,et al.  Analysis on Theoretical Bounds for Approximating Dominating Set Problems , 2009, Discret. Math. Algorithms Appl..

[3]  Jianer Chen,et al.  An Improved Kernel for Planar Connected Dominating Set , 2011, TAMC.

[4]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[5]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[6]  Erik D. Demaine,et al.  Open problem session , 2010, CCCG.

[7]  Deying Li,et al.  Minimum Connected R-Hop k-Dominating Set in Wireless Networks , 2009, Discret. Math. Algorithms Appl..

[8]  Donghyun Kim,et al.  A PTAS for Minimum d-Hop Underwater Sink Placement Problem in 2-d Underwater Sensor Networks , 2009, Discret. Math. Algorithms Appl..

[9]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[10]  Qian-Ping Gu,et al.  Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set , 2010, LATIN.

[11]  Dimitrios M. Thilikos,et al.  (Meta) Kernelization , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Saket Saurabh,et al.  Linear Kernel for Planar Connected Dominating Set , 2009, TAMC.

[14]  Hans L. Bodlaender,et al.  Kernelization: New Upper and Lower Bound Techniques , 2009, IWPEC.

[15]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, STACS.