Solving Connected Dominating Set Faster than 2n

Abstract In the connected dominating set problem we are given an n-node undirected graph, and we are asked to find a minimum cardinality connected subset S of nodes such that each node not in S is adjacent to some node in S. This problem is also equivalent to finding a spanning tree with maximum number of leaves. Despite its relevance in applications, the best known exact algorithm for the problem is the trivial Ω(2n) algorithm that enumerates all the subsets of nodes. This is not the case for the general (unconnected) version of the problem, for which much faster algorithms are available. Such a difference is not surprising, since connectivity is a global property, and non-local problems are typically much harder to solve exactly. In this paper we break the 2n barrier, by presenting a simple O(1.9407n) algorithm for the connected dominating set problem. The algorithm makes use of new domination rules, and its analysis is based on the Measure and Conquer technique.

[1]  Igor Razgon.  Exact Computation of Maximum Induced Forest , 2006, SWAT.

[2]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

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

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

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

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

[7]  Fabrizio Grandoni,et al.  Measure and conquer: a simple O(20.288n) independent set algorithm , 2006, SODA '06.

[8]  Andreas Björklund,et al.  Inclusion--Exclusion Algorithms for Counting Set Partitions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[9]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[10]  Mikko Koivisto,et al.  An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

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

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

[13]  Fedor V. Fomin,et al.  Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In , 2004, ICALP.

[14]  Jon M. Kleinberg,et al.  A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search , 2002, Theor. Comput. Sci..

[15]  David Eppstein,et al.  3-Coloring in Time O(1.3289^n) , 2000, J. Algorithms.

[16]  Fabrizio Grandoni,et al.  Measure and Conquer: Domination - A Case Study , 2005, ICALP.

[17]  Chaitanya Swamy,et al.  Primal–Dual Algorithms for Connected Facility Location Problems , 2004, Algorithmica.

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

[19]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

[20]  Walter Kern,et al.  An improved deterministic local search algorithm for 3-SAT , 2004, Theor. Comput. Sci..

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

[22]  Fedor V. Fomin,et al.  Exact algorithms for treewidth and minimum fill-in ∗ † , 2006 .

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

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

[25]  David Eppstein,et al.  Quasiconvex analysis of backtracking algorithms , 2003, SODA '04.

[26]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

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

[28]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

[29]  Fedor V. Fomin,et al.  Finding a Minimum Feedback Vertex Set in Time O (1.7548n) , 2006, IWPEC.

[30]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[31]  Ryan Williams.  A new algorithm for optimal constraint satisfaction and its implications , 2004, Electron. Colloquium Comput. Complex..

[32]  Tim Roughgarden,et al.  Simpler and better approximation algorithms for network design , 2003, STOC '03.

[33]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[34]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .

[35]  Jesper Makholm Byskov.  Enumerating maximal independent sets with applications to graph colouring , 2004, Oper. Res. Lett..