A faster algorithm for dominating set analyzed by the potential method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7112 LNCS, Issue , 2012, Pages 41-54

  Iwata, Yoichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING ALGORITHM; DOMINATING SETS; FUTURE APPLICATIONS; MINIMUM DOMINATING SET; OPTIMIZATION PROBLEMS; POLYNOMIAL SPACE; POTENTIAL METHODS; TIME AND SPACE ALGORITHMS; WORST-CASE COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

ALGORITHMS;

EID: 84858377485     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28050-4_4     Document Type: Conference Paper

References (13)

1. Eppstein, D.: Quasiconvex analysis of multivariate recurrence equations for back-tracking algorithms. ACM Transactions on Algorithms 2(4), 492-509 (2006)
2. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: Domination - A Case Study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 191-203. Springer, Heidelberg (2005) (Pubitemid 41436101)
3. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2010)
4. Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (Exponential) Algorithms for the Dominating Set Problem. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 245-256. Springer, Heidelberg (2004) (Pubitemid 39743798)
5. Gaspers, S., Sorkin, G.: A universally fastest algorithm for max 2-sat, max 2-csp, and everything in between. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 606-615. Society for Industrial and Applied Mathematics (2009)
6. Grandoni, F.: Exact algorithms for hard graph problems. Ph.D. thesis, Universitá di Roma "Tor Vergata" (2004)
7. Randerath, B., Schiermeyer, I.: Exact algorithms for MINIMUM DOMINATING SET. Tech. rep., zaik-469, Zentrum für Angewandte Informatik Köln, Germany (2004)
8. Robson, J.: Algorithms for maximum independent sets. Journal of Algorithms 7(3), 425-440 (1986)
9. van Rooij, J.M.M.: Design by measure and conquer: an O(1.5086n) algorithm for minimum dominating set and similar problems. Master's thesis, Utrecht University (2006)
10. van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer: a faster exact algorithm for dominating set. In: Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp. 657-668 (2008)
11. van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer: exact algorithms for dominating set. Tech. rep., UU-CS-2009-025, Utrecht University, The Netherlands (2009)
12. van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion/Exclusion Meets Measure and Conquer. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 554-565. Springer, Heidelberg (2009)
13. Wahlstrom, M.: Exact algorithms for finding minimum transversals in rank-3 hypergraphs. Journal of Algorithms 51(2), 107-121 (2004)