Parameterized Measure & Conquer for Problems with No Small Kernels

Measure & Conquer (M&C) is a prominent technique for analyzing exact algorithms for computationally hard problems, in particular, graph problems. It tries to balance worse and better situations within the algorithm analysis. This has led, e.g., to algorithms for Minimum Vertex Cover with a running time of $\mathcal{O}(c^{n})$ for some constant c≈1.2, where n is the number of vertices in the graph.Several obstacles prevent the application of this technique in parameterized algorithmics, making it rarely applied in this area. However, these difficulties can be handled in some situations. We will exemplify this with two problems related to Vertex Cover, namely Connected Vertex Cover and Edge Dominating Set. For both problems, several parameterized algorithms have been published, all based on the idea of first enumerating minimal vertex covers. Using M&C in this context will allow us to improve on the hitherto published running times. In contrast to some of the earlier suggested algorithms, ours will use polynomial space.

[1]  Mihalis Yannakakis,et al.  Edge Dominating Sets in Graphs , 1980 .

[2]  Toshihiro Fujito,et al.  On approximability of the independent/connected edge dominating set problems , 2000, Inf. Process. Lett..

[3]  Saket Saurabh,et al.  Incompressibility through Colors and IDs , 2009, ICALP.

[4]  Fedor V. Fomin,et al.  On Two Techniques of Combining Branching and Treewidth , 2009, Algorithmica.

[5]  Gregory Gutin,et al.  FPT algorithms and kernels for the Directed k-Leaf problem , 2008, J. Comput. Syst. Sci..

[6]  Ge Xia,et al.  Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems , 2003, Algorithmica.

[7]  Stefan Richter,et al.  Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover , 2006, Theory of Computing Systems.

[8]  Ján Plesník,et al.  Equivalence between the minimum covering problem and the maximum matching problem , 1984, Discret. Math..

[9]  Henning Fernau,et al.  Enumerate and Measure: Improving Parameter Budget Management , 2010, IPEC.

[10]  Jesper Nederlof.  Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems , 2009, ICALP.

[11]  Igor Razgon.  Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 , 2009, J. Discrete Algorithms.

[12]  Henning Fernau,et al.  Exact and Parameterized Algorithms for Max Internal Spanning Tree , 2009, WG.

[13]  Saket Saurabh,et al.  Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems , 2005, ICTCS.

[14]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[15]  Henning Fernau,et al.  Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs , 2008, WALCOM.

[16]  Elena Prieto Rodríguez,et al.  SYSTEMATIC KERNELIZATION IN FPT ALGORITHM DESIGN , 2005 .

[17]  Ján Plesník,et al.  Constrained Weighted Matchings and Edge Coverings in Graphs , 1999, Discret. Appl. Math..

[18]  Toshihiro Fujito,et al.  A 2-approximation NC algorithm for connected vertex cover and tree cover , 2004, Inf. Process. Lett..

[19]  Daniel Panario,et al.  Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics , 2007 .

[20]  Joachim Kneis,et al.  A New Algorithm for Finding Trees with Many Leaves , 2008, ISAAC.

[21]  Henning Fernau,et al.  An Amortized Search Tree Analysis for k-Leaf Spanning Tree , 2009, SOFSEM.

[22]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[23]  Henning Fernau,et al.  edge dominating set: Efficient Enumeration-Based Exact Algorithms , 2006, IWPEC.

[24]  Hans L. Bodlaender,et al.  Exact Algorithms for Edge Domination , 2008, IWPEC.

[25]  Hans L. Bodlaender,et al.  Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set , 2008, STACS.

[26]  Fabrizio Grandoni,et al.  A measure & conquer approach for the analysis of exact algorithms , 2009, JACM.

[27]  Henning Fernau,et al.  The Curse of Connectivity: t-Total Vertex (Edge) Cover , 2010, COCOON.

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

[29]  F. Fomin,et al.  The curse of connectivity: t-total vertex (edge) cover , 2010, COCOON 2010.

[30]  Henning Fernau,et al.  A new upper bound for Max-2-SAT: A graph-theoretic approach , 2008, J. Discrete Algorithms.

[31]  Serge Gaspers,et al.  A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between , 2009, J. Comput. Syst. Sci..

[32]  David Manlove,et al.  Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms , 2009, ACiD.

[33]  Rolf Niedermeier,et al.  Parameterized Complexity of Vertex Cover Variants , 2007, Theory of Computing Systems.

[34]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[35]  Thomas C. van Dijk,et al.  Inclusion/Exclusion Meets Measure and Conquer , 2009, ESA.