Solving Connected Dominating Set Faster Than 2n
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 Ω(2 n ) algorithm which 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 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 2 n barrier, by presenting a simple O(1.9407 n ) 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.
KeywordsExact Algorithm Reduction Rule Free Node Exponential Time Algorithm Algorithm Halt
Unable to display preview. Download preview PDF.
- 7.Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 781–790 (2004)Google Scholar
- 10.Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: A simple O(20.288 n) independent set algorithm. In: Proceedings of the17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 18–25 (2006)Google Scholar
- 13.Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann (1979)Google Scholar
- 16.Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 365–372. ACM, New York (2003)Google Scholar
- 18.Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of SIAM, 196–210 (1962)Google Scholar
- 22.Randerath, B., Schiermeyer, I.: Exact algorithms for MINIMUM DOMINATING SET. Technical Report, zaik-469, Zentrum für Angewandte Informatik Köln (April 2004)Google Scholar