Solving connected dominating set faster than 2 n

Algorithmica (New York)

Volumn 52, Issue 2, 2008, Pages 153-166

  Fomin, Fedor V ^a   Grandoni, Fabrizio ^b   Kratsch, Dieter ^c  

^a UNIVERSITY OF BERGEN   (Norway)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Connected dominating set; Exponential time exact algorithm; Maximum leaf spanning tree; NP hard problem

Indexed keywords

CARDINALITY; CONNECTED DOMINATING SET; EXACT ALGORITHMS; EXPONENTIAL-TIME EXACT ALGORITHM; MAXIMUM LEAF SPANNING TREE; NP-HARD PROBLEM; SPANNING TREES; UNDIRECTED GRAPHS;

TREES (MATHEMATICS);

EID: 50849114205     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9145-z     Document Type: Article

References (32)

1. n ). J. Algorithms 54, 168-204 (2005)
2. Björklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 575-582. IEEE (2006)
3. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and MANETs. In: Handbook of Combinatorial Optimization, Supplement vol. B, pp. 329-369. Springer, New York (2005)
4. Brueggemann, T., Kern, W.: An improved deterministic local search algorithm for 3-SAT. Theor. Comput. Sci. 329, 303-313 (2004)
5. Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32, 547-556 (2004)
6. n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289, 69-83 (2002)
7. Eppstein, D.: The traveling salesman problem for cubic graphs. In: Workshop on Algorithms and Data Structures (WADS), pp. 307-318 (2003)
8. Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 781-790 (2004)
9. n ). In: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006). Lecture Notes in Computer Science, vol. 4169, pp. 184-191. Springer, Berlin (2006)
10. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: domination-A case study. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005). Lecture Notes in Computer Science, vol. 3580, pp. 191-203. Springer, Berlin (2005)
11. Fomin, F.V., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. Bull. EATCS 87, 47-77 (2005)
12. 0.288n ) independent set algorithm. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 18-25 (2006)
13. Fomin, F.V., Kratsch, D., Todinca, I.: Exact algorithms for treewidth and minimum fill-in. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004). Lecture Notes in Computer Science, vol. 3142, pp. 568-580. Springer, Berlin (2004)
14. Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: Proceedings of the 30th Workshop on Graph Theoretic Concepts in Computer Science (WG 2004). Lecture Notes in Computer Science, vol. 3353, pp. 245-256. Springer, Berlin (2004)
15. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
16. Grandoni, F.: A note on the complexity of minimum dominating set. J. Discrete Algorithms 4(2), 209-214 (2006)
17. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374-387 (1998)
18. 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)
19. 1-ε. Acta Math. 182(1), 105-142 (1999)
20. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. SIAM 10, 196-210 (1962)
21. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63, 512-530 (2001)
22. Iwama, K.: Worst-case upper bounds for k-SAT. Bull. EATCS 82, 61-71 (2004)
23. n ) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 583-590. IEEE (2006)
24. Mölle, D., Richter, S., Rossmanith, P.: A faster algorithm for the steiner tree problem. In: Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS 2006). Lecture Notes in Computer Science, vol. 3884, pp. 561-570. Springer, Berlin (2006)
25. Randerath, B., Schiermeyer, I.: Exact algorithms for MINIMUM DOMINATING SET. Technical Report, zaik-469, Zentrum für Angewandte Informatik Köln, April (2004)
26. Razgon, I.: Exact computation of maximum induced forest. In: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006). Lecture Notes in Computer Science, vol. 4059, pp. 160-171. Springer, Berlin (2006)
27. Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms 7(3), 425-440 (1986)
28. Schöning, U.: Algorithmics in exponential time. In: Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS 2005). Lecture Notes in Computer Science, vol. 3404, pp. 36-43. Springer, Berlin (2005)
29. Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245-269 (2004)
30. Williams, R.: A new algorithm for optimal constraint satisfaction and its implications. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004). Lecture Notes in Computer Science, vol. 3142, pp. 1227-1237. Springer, Berlin (2004)
31. Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Combinatorial Optimization-Eureka, You Shrink. Lecture Notes in Computer Science, vol. 2570, pp. 185-207. Springer, Berlin (2003)
32. Woeginger, G.J.: Space and time complexity of exact algorithms: Some open problems. In: Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004). Lecture Notes in Computer Science, vol. 3162, pp. 281-290. Springer, Berlin (2004)