(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.  Parameterized Complexity , 1998 .

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

[3]  Paul Wollan,et al.  Finding topological subgraphs is fixed-parameter tractable , 2010, STOC '11.

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

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

[6]  Dimitrios M. Thilikos,et al.  Improving the gap of Erdös-Pósa property for minor-closed graph classes , 2008, CTW.

[7]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

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

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

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

[11]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[12]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1993, JACM.

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

[14]  Geevarghese Philip,et al.  Polynomial Kernels for Dominating Set in Ki,j-free and d-degenerate Graphs , 2009, ArXiv.

[15]  Gregory Gutin,et al.  Minimum Leaf Out-Branching Problems , 2008, AAIM.

[16]  Erik D. Demaine,et al.  Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality , 2005, SODA '05.

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

[18]  Dimitrios M. Thilikos,et al.  Strengthening Erdös-Pósa property for minor-closed graph classes , 2011, J. Graph Theory.

[19]  Ton Kloks,et al.  New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs , 2002, WG.

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

[21]  Hannes Moser,et al.  The parameterized complexity of the induced matching problem , 2009, Discret. Appl. Math..

[22]  P. Duchet,et al.  On Hadwiger''s number and stability number , 1982 .

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

[24]  Dimitrios M. Thilikos,et al.  Bidimensionality and kernels , 2010, SODA '10.

[25]  B. Mohar,et al.  Graph Minors , 2009 .

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

[27]  Torben Hagerup,et al.  Parallel Algorithms with Optimal Speedup for Bounded Treewidth , 1995, SIAM J. Comput..

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

[29]  Michael R. Fellows,et al.  On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design , 1989, SIAM J. Discret. Math..

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

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

[32]  Petr A. Golovach,et al.  Contraction Bidimensionality: the Accurate Picture , 2009, Parameterized complexity and approximation algorithms.

[33]  Saket Saurabh,et al.  A linear kernel for planar connected dominating set , 2011, Theor. Comput. Sci..

[34]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[35]  Bojan Mohar,et al.  Systems of Curves on Surfaces , 1996, J. Comb. Theory, Ser. B.

[36]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[37]  Hans L. Bodlaender,et al.  Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth , 1996, COCOON.

[38]  Martin Grohe,et al.  Deciding first-order properties of locally tree-decomposable structures , 2000, JACM.

[39]  Johan M. M. van Rooij.  Exact Exponential-Time Algorithms for Domination Problems in Graphs , 2011 .

[40]  Bojan Mohar,et al.  A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface , 1999, SIAM J. Discret. Math..

[41]  Barry O'Sullivan,et al.  A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, JACM.

[42]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion III. Restricted graph homomorphism dualities , 2008, Eur. J. Comb..

[43]  Stéphan Thomassé,et al.  A 4k2 kernel for feedback vertex set , 2010, TALG.

[44]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion I. Decompositions , 2008, Eur. J. Comb..

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

[46]  Michael R. Fellows,et al.  An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[47]  Stephan Kreutzer,et al.  Locally Excluding a Minor , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

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

[49]  Bruno Courcelle,et al.  The monadic second-order logic of graphs XVI : Canonical graph decompositions , 2005, Log. Methods Comput. Sci..

[50]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[51]  Bruno Courcelle,et al.  The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues , 1992, RAIRO Theor. Informatics Appl..

[52]  Rolf Niedermeier,et al.  Experiments on data reduction for optimal domination in networks , 2006, Ann. Oper. Res..

[53]  Erik D. Demaine,et al.  The Bidimensional Theory of Bounded-Genus Graphs , 2004, SIAM J. Discret. Math..

[54]  Gregory Gutin,et al.  Minimum leaf out-branching and related problems , 2008, Theor. Comput. Sci..

[55]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[56]  Fedor V. Fomin,et al.  Bidimensionality and EPTAS , 2010, SODA '11.

[57]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[58]  Rolf Niedermeier,et al.  Fixed‐parameter tractability results for full‐degree spanning tree and its dual , 2006, Networks.

[59]  Dimitrios M. Thilikos,et al.  (Meta) Kernelization , 2009, FOCS.

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

[61]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[62]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[63]  Gregory Gutin,et al.  Kernels in planar digraphs , 2005, J. Comput. Syst. Sci..

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

[65]  Martin Grohe,et al.  Algorithmic Meta Theorems , 2008, WG.

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

[67]  Erik D. Demaine,et al.  Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs , 2005, TALG.

[68]  Stephan Kreutzer,et al.  Computing excluded minors , 2008, SODA '08.

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

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

[71]  P. Dangerfield.  Logic , 1996, Aristotle and the Stoics.

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

[73]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion II. Algorithmic aspects , 2008, Eur. J. Comb..

[74]  Jiong Guo,et al.  Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual , 2006, IWPEC.

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

[76]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

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

[78]  Fedor V. Fomin,et al.  Hitting forbidden minors: Approximation and Kernelization , 2011, STACS.

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

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

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

[82]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[83]  Dimitrios M. Thilikos,et al.  Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms , 2010, Algorithmica.

[84]  Erik D. Demaine,et al.  Linearity of grid minors in treewidth with applications through bidimensionality , 2008, Comb..

[85]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[86]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[87]  Ge Xia,et al.  On the small cycle transversal of planar graphs , 2011, Theor. Comput. Sci..

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

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

[90]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.