(Meta) Kernelization

Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit a polynomial kernel if, in polynomial time, we can reduce the size of the instance I to a polynomial in k, while preserving the answer. In this paper, we show that all problems expressible in Counting Monadic Second Order Logic and satisfying a compactness property admit a polynomial kernel on graphs of bounded genus. Our second result is that all problems that have finite integer index and satisfy a weaker compactness condition admit a linear kernel on graphs of bounded genus. The study of kernels on planar graphs was initiated by a seminal paper of Alber, Fellows, and Niedermeier [J. ACM, 2004 ] who showed that Planar Dominating Set admits a linear kernel. Following this result, a multitude of problems have been shown to admit linear kernels on planar graphs by combining the ideas of Alber et al. with problem specific reduction rules. Our theorems unify and extend all previously known kernelization results for planar graph problems. Combining our theorems with the Erdos-Posa property we obtain various new results on linear kernels for a number of packing and covering problems.

[1]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[2]  Bruno Courcelle,et al.  Monadic Second-Order Evaluations on Tree-Decomposable Graphs , 1993, Theor. Comput. Sci..

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

[4]  Denis Lapoire,et al.  Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width , 1998, STACS.

[5]  Michael R. Fellows,et al.  Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.

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

[7]  Stéphan Thomassé.  A quadratic kernel for feedback vertex set , 2009, SODA.

[8]  Stephan Kreutzer,et al.  Algorithmic Meta-theorems , 2008, IWPEC.

[9]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, SIAM J. Comput..

[10]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[11]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[12]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[13]  Hannes Moser,et al.  The Parameterized Complexity of the Induced Matching Problem in Planar Graphs , 2007, FAW.

[14]  Noga Alon,et al.  Kernels for the Dominating Set Problem on Graphs with an Excluded Minor , 2008, Electron. Colloquium Comput. Complex..

[15]  Ge Xia,et al.  On the induced matching problem , 2011, J. Comput. Syst. Sci..

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

[17]  Jiong Guo,et al.  Fixed-parameter tractability results for full-degree spanning tree and its dual , 2010 .

[18]  Richard B. Tan,et al.  A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs , 2008, ISAAC.

[19]  Dimitrios M. Thilikos,et al.  Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up , 2004, ICALP.

[20]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[21]  Craig A. Tovey,et al.  Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families , 1992, Algorithmica.

[22]  Hans L. Bodlaender,et al.  A Linear Kernel for Planar Feedback Vertex Set , 2008, IWPEC.

[23]  B. D. Fluiter.  Algorithms for graphs of small treewidth , 1997 .

[24]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[25]  Geevarghese Philip,et al.  Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels , 2009, ESA.

[26]  Martin Grohe,et al.  Logic, graphs, and algorithms , 2007, Logic and Automata.

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

[28]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

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

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

[31]  Rolf Niedermeier,et al.  A General Data Reduction Scheme for Domination in Graphs , 2006, SOFSEM.