Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case

Dealing with the NP-complete Dominating Set problem on undirected graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In particular, we prove that Dominating Set on planar graphs has a so-called problem kernel of linear size, achieved by two simple and easy to implement reduction rules. This answers an open question from previous work on the parameterized complexity of Dominating Set on planar graphs.

[1]  Jan Arne Telle,et al.  Complexity of Domination-Type Problems in Graphs , 1994, Nord. J. Comput..

[2]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[3]  Rolf Niedermeier,et al.  Parameterized complexity: exponential speed-up for planar graph problems , 2004, J. Algorithms.

[4]  Rolf Niedermeier,et al.  Improved Tree Decomposition Based Algorithms for Domination-like Problems , 2002, LATIN.

[5]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[6]  Rolf Niedermeier,et al.  Graph Separators: A Parameterized View , 2001, COCOON.

[7]  R. Downey,et al.  Parameterized Computational Feasibility , 1995 .

[8]  R. Battiti,et al.  Covering Trains by Stations or the Power of Data Reduction , 1998 .

[9]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[10]  F. Roberts.  Graph Theory and Its Applications to Problems of Society , 1987 .

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

[12]  Rolf Niedermeier,et al.  Faster exact algorithms for hard problems: A parameterized point of view , 2001, Discret. Math..

[13]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[14]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems , 2000, SWAT.

[15]  Rolf Niedermeier,et al.  Refined Search Tree Technique for DOMINATING SET on Planar Graphs , 2001, MFCS.

[16]  Karsten Weihe.  On the Differences between "Practical" and "Applied" , 2000, Algorithm Engineering.

[17]  Michael R. Fellows,et al.  Parameterized Complexity: The Main Ideas and Some Research Frontiers , 2009, ISAAC.