A measure & conquer approach for the analysis of exact algorithms

Journal of the ACM

Volumn 56, Issue 5, 2009, Pages

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

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Dominating set; Exact algorithm; Independent set

Indexed keywords

BACKTRACKING ALGORITHM; DOMINATING SET; EXACT ALGORITHM; EXACT ALGORITHMS; EXACT SOLUTION; INDEPENDENT SET; LOWER BOUNDS; MAXIMUM INDEPENDENT SETS; MINIMUM DOMINATING SET; NP-HARD PROBLEM; RECURSIVE ALGORITHMS; RUNNING TIME; SIMPLE ALGORITHM; STANDARD ANALYSIS; TIME ANALYSIS; TIME BOUND;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTROL THEORY; WIRELESS TELECOMMUNICATION SYSTEMS;

SET THEORY;

EID: 70349335853     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1552285.1552286     Document Type: Article

References (70)

1. Alekhnovich, M., Hirsch, E., and Itsykon, D. 2005. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. J. Automat. Reas. 35, 1-3, 51-72.
2. Beigel, R. 1999. Finding maximum independent sets in sparse and general graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 856-857.
3. n). J. Algor. 54, 2, 168-204.
4. Bjrklund, A., and Husfeldt, T. 2006. Inclusion-exclusion algorithms for counting set partitions. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, 575-582.
5. Bodlaender, H., Fomin, F. V., Koster, A., Kratsch, D., and Thilikos, D. 2006. Exact algorithms for tree-width. In Proceedings of the European Symposium on Algorithms (ESA). 672-683.
6. Brueggemann, T., and Kern, W. 2004. An improved deterministic local search algorithm for 3-SAT. Theoret. Comput. Sci. 329, 303-313.
7. Byskov, J. M. 2004. Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32, 6, 547-556.
8. Chen, J., Kanj, I., and Jia, W. 2001. Vertex cover: Further observations and further improvements. J. Algor. 41, 280-301.
9. Chen, J., Kanj, I. A., and Xia, G. 2005. Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems. Algorithmica 43, 4, 245-273.
10. n algorithm for k-SAT based on local search. Theoret. Comput. Science 289, 1, 69-83.
11. Davis, M., Logemann, G., and Loveland, D. 1962. A machine program for theorem-proving. Comm. ACM 5, 394-397.
12. Davis, M., and Putnam, H. 1960. A computing procedure for quantification theory. J. ACM 7, 201-215.
13. Downey, R. G., and Fellows, M. R. 1999. Parameterized complexity. Monographs in Computer Science. Springer-Verlag, Berlin, Germany.
14. Ebenegger, C., Hammer, P. L., and de Werra, D. 1984. Pseudo Boolean functions and stability of graphs. Ann. Disc. Math. 19, 83-98.
15. Eppstein, D. 2003a. Small maximal independent sets and faster exact graph coloring. J. Graph Algor. Appl. 7, 2, 131-140.
16. Eppstein, D. 2003b. The traveling salesman problem for cubic graphs. In Proceedings of the Workshop on Algorithms and Data Structures (WADS). 307-318.
17. Eppstein, D. 2006. Quasiconvex analysis of backtracking algorithms. ACM Trans. Algor. 2, 4, 492-509.
18. Fomin, F. V., Gaspers, S., Pyatkin, A. V., and Razgon, I. 2008b. On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica 52, 2, 293-307.
19. Fomin, F., Grandoni, F., and Kratsch, D. 2005a. Measure and conquer: Dominationa case study. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 3580, Springer-Verlag, Berlin, Germany, 191-203.
20. Fomin, F., Grandoni, F., and Kratsch, D. 2005b. Some new techniques in design and analysis of exact (exponential) algorithms. Bull. Europ. Assoc. Theoret. Comput. Sci. 87, 47-77.
21. 0.288n) independent set algorithm. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 18-25.
22. Fomin, F., Grandoni, F., Pyatkin, A., and Stepanov, A. 2008a. Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algor. 5, 1.
23. n. Algorithmica 52, 2, 153-166.
24. Fomin, F. V., Kratsch, D., Todinca, I., and Villanger, Y. 2008d. Exact algorithms for tree-width and minimum fill-in. SIAM J. Comput. 1058-1079.
25. Fomin, F. V., Kratsch, D., and Woeginger, G. J. 2004. Exact (exponential) algorithms for the dominating set problem. In Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG). 199-210.
26. Fomin, F. V., and Stepanov, A. 2007. Counting minimum weighted dominating sets. In Proceedings of the International Computing and Combinatorics Conference (COCOON). 65-74.
27. Frer, M. 2006. A faster algorithm for finding maximum independent sets in sparse graphs. In Proceedings of the Latin American Theoretical Informatics Symposium (LATIN). 491-501.
28. Gaspers, S., and Liedloff, M. 2006. A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. In Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG). 78-89.
29. Gramm, J., Hirsch, E. A., Niedermeier, R., and Rossmanith, P. 2003. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Disc. Appl. Math. 130, 2, 139-155.
30. Grandoni, F. 2004. Exact algorithms for hard graph problems. Ph.D. dissertation, Universit di Roma Tor Vergata Roma, Italy.
31. Grandoni, F. 2006. A note on the complexity of minimum dominating set. J. Disc. Algor. 4, 2, 209-214.
32. Gupta, S., Raman, V., and Saurabh, S. 2006. Fast exponential algorithms for maximum regular induced subgraph problems. In Proceedings of the Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 139-151.
33. 1-ε. Acta Math. 182, 1, 105-142.
34. Haynes, T. W., Hedetniemi, S. T., and Slater, P. J. 1998. Fundamentals of Domination in Graphs. Marcel Dekker, Inc., New York.
35. Held, M., and Karp, R. M. 1962. A dynamic programming approach to sequencing problems. J. SIAM 10, 196-210.
36. Hirsch, E. A. 2000a. New worst-case upper bounds for SAT. J. Automat. Reason. 24, 4, 397-420.
37. Hirsch, E. A. 2000b. SAT local search algorithms: worst-case study. J. Automat. Reason. 24, 1-2, 127-143.
38. Horowitz, E., and Sahni, S. 1974. Computing partitions with applications to the knapsack problem. J. ACM 21, 277-292.
39. Impagliazzo, R., Paturi, R., and Zane, F. 2001. Which problems have strongly exponetial complexity? J. Comput. Syst. Sci. 63, 512-530.
40. Iwama, K. 2004. Worst-case upper bounds for k-SAT. Bull. Europ. Associ. Theoret. Comp. Sci. 82, 61-71.
41. Iwama, K., and Tamaki, S. 2004. Improved upper bounds for 3-SAT. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 328-329.
42. 0.304n) algorithm for solving maximum independent set problem. IEEE Trans. Comput. 35, 9, 847-851.
43. Kohn, S., Gottlieb, A., and Kohn, M. 1977. A generating function approach to the traveling salesman problem. In Proceedings of the Annual ACM Conference. 294-300.
44. n) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). 583-590.
45. Kojevnikov, A., and Kulikov, A. S. 2006. A new approach to proving upper bounds for MAX-2-SAT. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). 11-17.
46. Kowalik, L. 2006. Improved edge-coloring with three colors. In Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG). 90-101.
47. Kratsch, D., and Liedloff, M. 2007. An exact algorithm for the minimum dominating clique problem. Theoret. Comput. Sci. 385, 1-3, 226-240.
48. Kullmann, O. 1999. New methods for 3-SAT decision and worst-case analysis. Theoret. Comput. Sci. 223, 1-2, 1-72.
49. Lawler, E. L. 1976. A note on the complexity of the chromatic number problem. Info. Process. Lett. 5, 3, 66-67.
50. n steps. Disc. Appl. Math. 10, 3, 287-295.
51. Paturi, R., Pudlk, P., Saks, M. E., and Zane, F. 2005. An improved exponential-time algorithm for k-SAT. J ACM 52, 3, 337-364.
52. Pudlak, P., and Impagliazzo, R. 2000. A lower bound for DLL algorithms for k-SAT. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) ACM, New York, 128-136.
53. Randerath, B. and Schiermeyer, I. 2004. Exact algorithms for MINIMUM DOMINATING SET. Tech. Rep. zaik-469, Zentrum fr Angewandte Informatik, Kln, Germany.
54. Raz, R., and Safra, S. 1997. A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In Proceedings of the ACM Symposium on the Theory of Computing (STOC). ACM, New York, 475-484.
55. Razgon, I. 2006a. Exact computation of maximum induced forest. In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT). 160-171.
56. Razgon, I. 2006b. A faster solving of the maximum independent set problem for graphs with maximal degree 3. In Proceedings of the Algorithms and Complexity in Durham Workshop (ACiD). 131-142.
57. Reed, B. 1996. Paths, stars and the number three. Combinatorics, Probability and Computing 5, 3, 277-295.
58. 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.
59. Robson, J. M. 1986. Algorithms for maximum independent sets. J. Algor. 7, 3, 425-440.
60. n/4). Tech. Rep. 1251-01, LaBRI, Universit Bordeaux I.
61. Schning, U. 1999. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceeding of the IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, 410-414.
62. Schning, U. 2005. Algorithmics in exponential time. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS). 36-43.
63. n/4) algorithm for certain NP-complete problems. SIAM J. Comput. 10, 3, 456-464.
64. Tarjan, R., and Trojanowski, A. 1977. Finding a maximum independent set. SIAM J. Comput. 6, 3, 537-546.
65. van Rooij, J., and Bodlaender, H. L. 2008. Design by measure and conquer, a faster exact algorithm for dominating set. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS). 657-668.
66. Villanger, Y. 2006. Improved exponential-time algorithms for tree-width and minimum fill-in. In Proceedings of the Latin American Theoretical Informatics Symposium (LATIN). 800-811.
67. West, D. B. 1996. Introduction to Graph Theory. Prentice Hall, Englewood Cliffs.
68. Williams, R. 2005. A new algorithm for optimal 2-constraint satisfaction and its implications. Theoret. Comput. Sci. 348, 2-3, 357-365.
69. Woeginger, G. J. 2003. Exact algorithms for NP-hard problems: A survey. In Proceedings of the International Workshop on Combinatorial Optimization - Eureka, You Shrink, M. Jnger, G. Reinelt, and G. Rinaldi, Eds. Lecture Notes in Computer Science. vol. 2570. Springer-Verlag, Berlin, Germany 185-207.
70. Zuckerman, D. 2006. Linear degree extractors and the inapproximability of max clique and chromatic number. In Proceedings of the ACM Symposium on the Theory of Computing (STOC). 681-690.