Exact algorithms for dominating set

The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems like Dominating Set and Independent Set. This approach is used in this paper to obtain a faster exact algorithm for Dominating Set. We obtain this algorithm by considering a series of branch and reduce algorithms. This series is the result of an iterative process in which a mathematical analysis of an algorithm in the series with measure and conquer results in a convex or quasiconvex programming problem. The solution, by means of a computer, to this problem not only gives a bound on the running time of the algorithm, but can also give an indication on where to look for a new reduction rule, often giving a new, possibly faster algorithm. As a result, we obtain an O(1.4969^n) time and polynomial space algorithm.

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

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

[3]  David Eppstein,et al.  Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms , 2006, TALG.

[4]  Fabrizio Grandoni,et al.  Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms , 2005, Bull. EATCS.

[5]  R. Tarjan.  Finding a Maximum Clique. , 1972 .

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

[7]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[8]  David S. Johnson,et al.  What are the least tractable instances of max independent set? , 1999, SODA '99.

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

[10]  Kazuo Iwama,et al.  Worst-Case Upper Bounds for kSAT (Column: Algorithmics) , 2004, Bull. EATCS.

[11]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[14]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[15]  Thomas C. van Dijk,et al.  Inclusion/Exclusion Meets Measure and Conquer Exact Algorithms for Counting Dominating Sets , 2009 .

[16]  Mathieu Liedloff,et al.  A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set , 2012, Discret. Math. Theor. Comput. Sci..

[17]  Gerhard J. Woeginger,et al.  Open problems around exact algorithms , 2008, Discret. Appl. Math..

[18]  Uwe Schöning,et al.  Algorithmics in Exponential Time , 2005, STACS.

[19]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[20]  Vangelis Th. Paschos,et al.  Fast Algorithms for max independent set , 2010, Algorithmica.

[21]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

[22]  Fabrizio Grandoni,et al.  Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications , 2008, TALG.

[23]  Fabrizio Grandoni,et al.  A note on the complexity of minimum dominating set , 2006, J. Discrete Algorithms.

[24]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[25]  Dieter Kratsch,et al.  An exact algorithm for the minimum dominating clique problem , 2006, Theor. Comput. Sci..

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

[27]  Gerhard J. Woeginger,et al.  Space and Time Complexity of Exact Algorithms : Some Open Problems , 2004 .

[28]  Ingo Schiermeyer,et al.  Efficiency in exponential time for domination-type problems , 2008, Discret. Appl. Math..

[29]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[30]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..