edge dominating set: Efficient Enumeration-Based Exact Algorithms

We analyze EDGE DOMINATING SET from a parameterized perspective. More specifically, we prove that this problem is in FPT for general (weighted) graphs. The corresponding algorithms rely on enumeration techniques. In particular, we show how the use of compact representations may speed up the decision algorithm.

[1]  Rolf Niedermeier,et al.  Improved Fixed-Parameter Algorithms for Two Feedback Set Problems , 2005, WADS.

[2]  Robert D. Carr,et al.  A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem , 2001, J. Comb. Optim..

[3]  Michael R. Fellows,et al.  An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem , 2005, COCOON.

[4]  Ojas Parekh,et al.  Linear Time Algorithms for Generalized Edge Dominating Set Problems , 2005, WADS.

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

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

[7]  Joseph Douglas Horton,et al.  Minimum Edge Dominating Sets , 1993, SIAM J. Discret. Math..

[8]  Hiroshi Nagamochi,et al.  A 2-approximation algorithm for the minimum weight edge dominating set problem , 2002, Discret. Appl. Math..

[9]  Gerhard J. Woeginger,et al.  Exact (Exponential) Algorithms for the Dominating Set Problem , 2004, WG.

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

[11]  Robert D. Carr,et al.  A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem , 2000, ESA.

[12]  Ojas Parekh,et al.  Edge dominating and hypomatchable sets , 2002, SODA '02.

[13]  David F. Manlove.  Minimaximal and maximinimal optimisation problems : a partial order-based approach , 1998 .

[14]  Michael R. Fellows,et al.  Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems , 2000, FSTTCS.

[15]  Peter Damaschke,et al.  Parameterized enumeration, transversals, and imperfect phylogeny reconstruction , 2004, Theor. Comput. Sci..

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

[17]  Henning Fernau,et al.  On Parameterized Enumeration , 2002, COCOON.

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

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

[20]  Mark Weston.  A fixed-parameter tractable algorithm for matrix domination , 2004, Inf. Process. Lett..

[21]  Rolf Niedermeier,et al.  An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover , 1999, J. Algorithms.

[22]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[23]  Chuan Yi Tang,et al.  Perfect edge domination and efficient edge domination in graphs , 2002, Discret. Appl. Math..