Design by measure and conquer a faster exact algorithm for dominating set

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 657-668

  Van Rooij, Johan M M ^a   Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Branch and reduce; Computer aided algorithm design; Dominating set; Exact algorithms; Exponential time algorithms; Measure and conquer

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ALGORITHM DESIGN; BRANCH AND REDUCE; DOMINATING SETS; EXACT ALGORITHMS; EXPONENTIAL TIME ALGORITHM; MEASURE AND CONQUER;

ITERATIVE METHODS;

EID: 45749102084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. M. David and H. Putnam. A computing procedure for quantification theory. J. ACM, 7:201-215, 1960.
2. J. Edmonds. Paths, trees, and flowers. Canad. J. Math., 17:445-467, 1965.
3. D. Eppstein. Quasiconvex analysis of backtracking algorithms. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pages 781-790, 2004.
4. F. V. Fomin, F. Grandoni, and D. Kratsch. Measure and conquer: Domination - a case study. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005, pages 191-203. Springer Verlag, Lecture Notes in Computer Science, vol. 3580, 2005.
5. F. V. Fomin, F. Grandoni, and D. Kratsch. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS, 87:47-77, 2005.
6. 0.288n) independent set algorithm. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pages 18-25, 2006.
7. n. In S. Arun-Kumar and N. Garg, editors, Proceedings 26th International Comference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2006, pages 152-163. Springer Verlag, Lecture Notes in Computer Science, vol. 4337, 2006.
8. F. V. Fomin, F. Grandoni, and D. Kratsch. A measure & conquer approach for the analysis of exact algorithms. Technical Report 359, Department of Informatics, University of Bergen, Bergen, Norway, 2007.
9. F. V. Fomin, F. Grandoni, A. Pyatkin, and A.A. Stepanov. Bounding the number of minimal dominating sets: a measure and conquer approach. In Proceedings 16th International Symposium on Algorithms and Computation, ISAAC 2005, pages 192-203. Springer Verlag, Lecture Notes in Computer Science, vol. 3827, 2005.
10. F. V. Fomin, D. Kratsch, and G. J. Woeginger. Exact (exponential) algorithms for the dominating set problem. In J. Hromkovič, M. Nagl, and B. Westfechtel, editors, Proceedings 30th International Workshop on Graph-Theoretic Concepts in Computer Science WG'04, page 245=256. Springer Verlag, Lecture Notes in Computer Science, vol. 3353, 2004.
11. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
12. S. Gaspers and M. Liedloff. A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. In F. V. Fomin, editor, Proceedings 32nd International Workshop on Graph-Theoretic Concepts in Computer Science WG'06, pages 78-89. Springer Verlag, Lecture Notes in Computer Science, vol. 4271, 2006.
13. F. Grandoni. A note on the complexity of minimum dominating set. J. Disc. Alg., 4:209-214, 2006.
14. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85 - 104. Plenum Press, 1972.
15. D. Kratsch and M. Liedloff. An exact algorithm for the minimum dominating clique problem. In H. L. Bodlaender and M. A. Langston, editors, Proceedings 2nd International Workshop on Parameterized and Exact Computation, IWPEC 2006, pages 128-139. Springer Verlag, Lecture Notes in Computer Science, vol. 4169, 2006.
16. B. Randerath and I. Schiermeyer. Exact algorithms for minimum dominating set. Technical Report zaik2005-501, Universität zu Köln, Cologne, Germany, 2005.
17. J. M. Robson. Algorithms for maximum independent sets. J. Algorithms, 7:425-440, 1986.
18. R. E. Tarjan. Finding a maximum clique. Technical report, Department of Computer Science, Cornell University, Ithaca, NY, 1972.
19. R. E. Tarjan and A. Trojanowski. Finding a maximum independent set. SIAM J. Comput., 6:537-546, 1977.
20. n) algorithm for minimum dominating set and similar problems. Master's thesis, Institute for Information and Computing Sciences, Utrecht University, 2006.
21. G. J. Woeginger. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization: "Eureka, you shrink", pages 185-207, Berlin, 2003. Springer Lecture Notes in Computer Science, vol. 2570.
22. G. J. Woeginger. Space and time complexity of exact algorithms: some open problems (invited talk). In R. G. Downey and M. R. Fellows, editors, Proceedings 1st International Workshop on Parameterized and Exact Computation, IWPEC 2004, pages 281-290, Berlin, 2004. Springer Lecture Notes in Computer Science, vol. 3162.