Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications

ACM Transactions on Algorithms

Volumn 5, Issue 1, 2008, Pages

  Fomin, Fedor V ^a   Grandoni, Fabrizio ^b   Pyatkin, Artem V ^c   Stepanov, Alexey A ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Domatic number; Exact exponential algorithms; Listing algorithms; Measure and conquer; Minimum dominating set; Minimum set cover

Indexed keywords

DOMATIC NUMBER; EXACT EXPONENTIAL ALGORITHMS; LISTING ALGORITHMS; MEASURE AND CONQUER; MINIMUM DOMINATING SET; MINIMUM SET COVER;

COMBINATORIAL MATHEMATICS;

EID: 57849165513     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1435375.1435384     Document Type: Article

References (32)

1. BEIGEL, R. 1999. Finding maximum independent sets in sparse and general graphs. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM and SIAM, 856-857.
2. BJ̈RKLUND, A., AND HUSFELDT, T. 2006. Inclusion-Exclusion algorithms for counting set partitions. In Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), 575-582.
3. BJÖRKLUND, A., AND HUSFELDT, T. 2008. Exact algorithms for exact satisfiability and number of perfect matchings Algorithmica 52, 2, 226-249.
4. BJÖRKLUND, A., HUSFELDT, T., AND, KOIVISTO M. 2008. Set partitioning via inclusionnexclusion. SIAM J. Comput. to appear.
5. BRÈGMAN, L. M. 1973. Certain properties of nonnegative matrices and their permanents. Doklady Akademii Nauk BSSR. 211, 27-30.
6. BYSKOV, J. M., AND EPPSTEIN, D. 2004. An algorithm for enumerating maximal bipartite subgraphs. manuscript.
7. n algorithm for K-SAT based on local search. Theor. Comput. Sci. 289, 69-83.
8. EGORYCHEV, G. P. 1981. Proof of the van der Waerden conjecture for permanents. Sibirsk. Mat. Zh. 22, 65-71, 225.
9. EPPSTEIN, D. 2003. Small maximal independent sets and faster exact graph coloring. J. Graph Algor. Appl. 7, 2, 131-140.
10. EPPSTEIN, D. 2004. Quasiconvex analysis of backtracking algorithms. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM and SIAM, 781-790.
11. FOMIN, F. V., GRANDONI, F., AND KRATSCH, D. 2005a. Measure and conquer: Domination-A case study. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 3580. Springer, Berlin, 191-203.
12. FOMIN, F. V., GRANDONI, F., AND KRATSCH, D. 2005b. Some new techniques in design and analysis of exact (exponential) algorithms. Bull. Eur. Assoc. Theor. Comput. Sci. 87, 47-77.
13. 0.288n) independent set algorithm. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM and SIAM, New York, 18-25.
14. FOMIN, F. V., GRANDONI, F., PYATKIN, A. V., AND STEPANOV, A. 2005. Bounding the number of minimal dominating sets: A measure and conquer approach. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC). Lecture Notes in Computer Science, vol. 3827. Springer, Berlin, 573-582.
15. FOMIN, F. V., KRATSCH, D., AND TODINCA, I. 2004. Exact algorithms for treewidth and minimum fill-in. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 3142. Springer, Berlin, 568-580.
16. FOMIN, F. V., KRATSCH, D., AND WOEGINGER, G. J. 2004. Exact (exponential) algorithms for the dominating set problem. In Proceedings of the 30th Workshop on Graph Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 3353. Springer, Berlin, 245-256.
17. GRANDONI, F. 2006. A note on the complexity of minimum dominating set. J. Discrete Algor. 4, 2, 209-214.
18. GRANDONI, F. 2004. Exact algorithms for hard graph problems. Ph.D. thesis, Università di Roma "Tor Vergata", Rome, Italy.
19. HAYNES, T. W., AND HEDETNIEMI, S. T., eds. 1998. Domination in Graphs. Marcel Dekker, New York.
20. HELD, M., AND KARP, R. M. 1962. A dynamic programming approach to sequencing problems. J. SIAM, 10, 196-210.
21. IWAMA, K., AND TAMAKI, S. 2004. Improved upper bounds for 3-SAT. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM and SIAM, 328.
22. n) algorithm for graph colouring and other partitioning problems via inclusion-exclusion. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 583-590.
23. LAWLER, E. L. 1976. A note on the complexity of the chromatic number problem. Inf. Proc. Lett. 5, 3, 66-67.
24. MOON, J. W., AND MOSER, L. 1965. On cliques in graphs. Israel J. Math. 3, 23-28.
25. RANDERATH, B., AND SCH1ERMEYER, I. 2004. Exact algorithms for minimum dominating set. Tech. Rep. zaik-469, Zentrum für Angewandte Informatik Köln, Germany.
26. n algorithm for the three domatic number problem. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 3618. Springer, Berlin, 733-744.
27. RIEGE, T., ROTHE, J., SPAKOWSKI, H., AND YAMAMOTO, M. 2007. An improved exact algorithm for the domatic number problem. Inf. Proc. Lett. 101, 3, 101-106.
28. VAN ROOIJ, J. M. M., AND BODLAENDER, H. L. 2008. 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), Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFT), Schloss Dagstuhl, Germany, 657-668.
29. TARJAN, R. E., AND TROJANOWSKI, A. E. 1997. Finding a maximum independent set. SIAM J. Comput. 6, 3, 537-546.
30. VAN DER WAERDEN, B. 1926. Problem 45. Jahresber. Deutsch. Math.-Verein., 35, 117.
31. WILLIAMS, R. 2005. A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci. 348, 2-3, 357-365.
32. WOEGINGER, G. 2003. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization-Eureka, You Shrink!. Lecture Notes in Computer Science, vol. 2570. Springer, Berlin, 185-207.