Fedor V. Fomin
Skip Abstract Section
Abstract
For more than 40 years, Branch & Reduce exponential-time backtracking algorithms have been among the most common tools used for finding exact solutions of NP-hard problems. Despite that, the way to analyze such recursive algorithms is still far from producing tight worst-case running time bounds. Motivated by this, we use an approach, that we call “Measure & Conquer”, as an attempt to step beyond such limitations. The approach is based on the careful design of a nonstandard measure of the subproblem size; this measure is then used to lower bound the progress made by the algorithm at each branching step. The idea is that a smarter measure may capture behaviors of the algorithm that a standard measure might not be able to exploit, and hence lead to a significantly better worst-case time analysis.
In order to show the potentialities of Measure & Conquer, we consider two well-studied NP-hard problems: minimum dominating set and maximum independent set. For the first problem, we consider the current best algorithm, and prove (thanks to a better measure) a much tighter running time bound for it. For the second problem, we describe a new, simple algorithm, and show that its running time is competitive with the current best time bounds, achieved with far more complicated algorithms (and standard analysis).
Our examples show that a good choice of the measure, made in the very first stages of exact algorithms design, can have a tremendous impact on the running time bounds achievable.
- 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. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- Beigel, R., and Eppstein, D. 2005. 3-coloring in time O(1.3289n). J. Algor. 54, 2, 168--204. Google ScholarDigital Library
- Björklund, 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Brueggemann, T., and Kern, W. 2004. An improved deterministic local search algorithm for 3-SAT. Theoret. Comput. Sci. 329, 303--313. Google ScholarDigital Library
- Byskov, J. M. 2004. Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32, 6, 547--556. Google ScholarDigital Library
- Chen, J., Kanj, I., and Jia, W. 2001. Vertex cover: Further observations and further improvements. J. Algor. 41, 280--301. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Dantsin, E., Goerdt, A., Hirsch, E. A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., and Schning, U. 2002. A deterministic (2 − 2/(k + 1))n algorithm for k-SAT based on local search. Theoret. Comput. Science 289, 1, 69--83. Google ScholarDigital Library
- Davis, M., Logemann, G., and Loveland, D. 1962. A machine program for theorem-proving. Comm. ACM 5, 394--397. Google ScholarDigital Library
- Davis, M., and Putnam, H. 1960. A computing procedure for quantification theory. J. ACM 7, 201--215. Google ScholarDigital Library
- Downey, R. G., and Fellows, M. R. 1999. Parameterized complexity. Monographs in Computer Science. Springer-Verlag, Berlin, Germany.Google Scholar
- Ebenegger, C., Hammer, P. L., and de Werra, D. 1984. Pseudo Boolean functions and stability of graphs. Ann. Disc. Math. 19, 83--98.Google Scholar
- Eppstein, D. 2003a. Small maximal independent sets and faster exact graph coloring. J. Graph Algor. Appl. 7, 2, 131--140.Google ScholarCross Ref
- Eppstein, D. 2003b. The traveling salesman problem for cubic graphs. In Proceedings of the Workshop on Algorithms and Data Structures (WADS). 307--318.Google ScholarCross Ref
- Eppstein, D. 2006. Quasiconvex analysis of backtracking algorithms. ACM Trans. Algor. 2, 4, 492--509. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Fomin, F., Grandoni, F., and Kratsch, D. 2005a. Measure and conquer: Domination—a 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. Google ScholarDigital Library
- 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.Google Scholar
- Fomin, F., Grandoni, F., and Kratsch, D. 2006. Measure and conquer: A simple O(20.288n) independent set algorithm. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 18--25. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Fomin, F. V., Grandoni, F., and Kratsch, D. 2008c. Solving connected dominating set faster than 2n. Algorithmica 52, 2, 153--166. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Fomin, F. V., and Stepanov, A. 2007. Counting minimum weighted dominating sets. In Proceedings of the International Computing and Combinatorics Conference (COCOON). 65--74. Google ScholarDigital Library
- Fürer, 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Grandoni, F. 2004. Exact algorithms for hard graph problems. Ph.D. dissertation, Università di Roma “Tor Vergata”, Roma, Italy.Google Scholar
- Grandoni, F. 2006. A note on the complexity of minimum dominating set. J. Disc. Algor. 4, 2, 209--214.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Håstad, J. 1999. Clique is hard to approximate within n1−ε. Acta Math. 182, 1, 105--142.Google ScholarCross Ref
- Haynes, T. W., Hedetniemi, S. T., and Slater, P. J. 1998. Fundamentals of Domination in Graphs. Marcel Dekker, Inc., New York.Google Scholar
- Held, M., and Karp, R. M. 1962. A dynamic programming approach to sequencing problems. J. SIAM 10, 196--210.Google Scholar
- Hirsch, E. A. 2000a. New worst-case upper bounds for SAT. J. Automat. Reason. 24, 4, 397--420. Google ScholarDigital Library
- Hirsch, E. A. 2000b. SAT local search algorithms: worst-case study. J. Automat. Reason. 24, 1-2, 127--143. Google ScholarDigital Library
- Horowitz, E., and Sahni, S. 1974. Computing partitions with applications to the knapsack problem. J. ACM 21, 277--292. Google ScholarDigital Library
- Impagliazzo, R., Paturi, R., and Zane, F. 2001. Which problems have strongly exponetial complexity? J. Comput. Syst. Sci. 63, 512--530. Google ScholarDigital Library
- Iwama, K. 2004. Worst-case upper bounds for k-SAT. Bull. Europ. Associ. Theoret. Comp. Sci. 82, 61--71.Google Scholar
- 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. Google ScholarDigital Library
- Jian, T. 1986. An O(20.304n) algorithm for solving maximum independent set problem. IEEE Trans. Comput. 35, 9, 847--851. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Koivisto, M. 2006. An O(2n) 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Kratsch, D., and Liedloff, M. 2007. An exact algorithm for the minimum dominating clique problem. Theoret. Comput. Sci. 385, 1--3, 226--240. Google ScholarDigital Library
- Kullmann, O. 1999. New methods for 3-SAT decision and worst-case analysis. Theoret. Comput. Sci. 223, 1-2, 1--72. Google ScholarDigital Library
- Lawler, E. L. 1976. A note on the complexity of the chromatic number problem. Info. Process. Lett. 5, 3, 66--67.Google ScholarCross Ref
- Monien, B., and Speckenmeyer, E. 1985. Solving satisfiability in less than 2n steps. Disc. Appl. Math. 10, 3, 287--295.Google ScholarDigital Library
- Paturi, R., Pudlák, P., Saks, M. E., and Zane, F. 2005. An improved exponential-time algorithm for k-SAT. J ACM 52, 3, 337--364. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Randerath, B. and Schiermeyer, I. 2004. Exact algorithms for MINIMUM DOMINATING SET. Tech. Rep. zaik-469, Zentrum für Angewandte Informatik, Köln, Germany.Google Scholar
- 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. Google ScholarDigital Library
- Razgon, I. 2006a. Exact computation of maximum induced forest. In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT). 160--171. Google ScholarDigital Library
- 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.Google Scholar
- Reed, B. 1996. Paths, stars and the number three. Combinatorics, Probability and Computing 5, 3, 277--295.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- Robson, J. M. 1986. Algorithms for maximum independent sets. J. Algor. 7, 3, 425--440.Google ScholarCross Ref
- Robson, J. M. 2001. Finding a maximum independent set in time O(2n/4). Tech. Rep. 1251-01, LaBRI, Université Bordeaux I.Google Scholar
- Schöning, 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. Google ScholarDigital Library
- Schöning, U. 2005. Algorithmics in exponential time. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS). 36--43. Google ScholarDigital Library
- Schroeppel, R., and Shamir, A. 1981. A T = O(2n/2), S = O(2n/4) algorithm for certain NP-complete problems. SIAM J. Comput. 10, 3, 456--464.Google ScholarCross Ref
- Tarjan, R., and Trojanowski, A. 1977. Finding a maximum independent set. SIAM J. Comput. 6, 3, 537--546.Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- West, D. B. 1996. Introduction to Graph Theory. Prentice Hall, Englewood Cliffs.Google Scholar
- Williams, R. 2005. A new algorithm for optimal 2-constraint satisfaction and its implications. Theoret. Comput. Sci. 348, 2-3, 357--365. Google ScholarDigital Library
- 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. Jünger, G. Reinelt, and G. Rinaldi, Eds. Lecture Notes in Computer Science. vol. 2570. Springer-Verlag, Berlin, Germany 185--207. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- A measure & conquer approach for the analysis of exact algorithms
Recommendations
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O(1.7159n). This result can be seen as an algorithmic proof of the fact that the number of minimal dominating sets in a graph on n vertices is at most 1.7159n, ...
Measure and conquer: domination – a case study
ICALP'05: Proceedings of the 32nd international conference on Automata, Languages and ProgrammingDavis-Putnam-style exponential-time backtracking algorithms are the most common algorithms used for finding exact solutions of NP-hard problems. The analysis of such recursive algorithms is based on the bounded search tree technique: a measure of the ...
Exact algorithms for dominating set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems like Dominating Set and Independent Set. This approach is used in this paper to obtain a faster exact algorithm for Dominating Set. ...
Comments