Abstract
In this paper, two central techniques from the field of exponential time algorithms are combined for the first time: inclusion/exclusion and branching with measure and conquer analysis.
In this way, we have obtained an algorithm that, for each κ, counts the number of dominating sets of size κ in \(\mathcal{O}(1.5048^n)\) time. This algorithm improves the previously fastest algorithm that counts the number of minimum dominating sets. The algorithm is even slightly faster than the previous fastest algorithm for minimum dominating set, thus improving this result while computing much more information.
When restricted to c-dense graphs, circle graphs, 4-chordal graphs or weakly chordal graphs, our combination of branching with inclusion/exclusion leads to significantly faster counting and decision algorithms than the previously fastest algorithms for dominating set.
All results can be extended to counting (minimum) weight dominating sets when the size of the set of possible weight sums is polynomially bounded.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bax, E.T.: Inclusion and exclusion algorithm for the hamiltonian path problem. Information Processing Letters 47(4), 203–207 (1993)
Bax, E.T.: Recurrence-based reductions for inclusion and exclusion algorithms applied to #P problems (1996)
Björklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52(2), 226–249 (2008)
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 67–74. ACM, New York (2007)
Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal of Computing, Special Issue for FOCS 2006 (to appear)
Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–23 (1993)
Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. The Computer Journal 51(3), 255–269 (2008)
Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 781–790 (2004)
Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and treewidth. In: Algorithmica Special issue of ISAAC 2006 (2006) (to appear)
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)
Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: a simple O(20.288n) independent set algorithm. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pp. 18–25 (2006)
Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Information Processing Letters 97, 191–196 (2006)
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)
Gaspers, S., Kratsch, D., Liedloff, M.: Exponential time algorithms for the minimum dominating set problem on some graph classes. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 148–159. Springer, Heidelberg (2006)
Gaspers, S., Sorkin, G.B.: A universally fastest algorithm for max 2-sat, max 2-csp, and everything in between. In: Proceedings of the 20th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009). SIAM, Philadelphia (to appear, 2009)
Grandoni, F.: A note on the complexity of minimum dominating set. J. Disc. Alg. 4, 209–214 (2006)
Karp, R.M.: Dynamic programming meets the principle of inclusion-exclusion. Operations Research Letters 1, 49–51 (1982)
Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Algorithms based on the treewidth of sparse graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 385–396. Springer, Heidelberg (2005)
Paulusma, D., van Rooij, J.M.M.: A fast exact algorithm for the 2-role assignment problem (submitted)
Randerath, B., Schiermeyer, I.: Exact algorithms for minimum dominating set. Technical Report zaik2004-469, Universität zu Köln, Cologne, Germany (2005)
van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer – a faster exact algorithm for dominating set. In: Albers, S., Weil, P. (eds.) Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2008, pp. 657–668. IBFI Schloss Dagstuhl (2008)
van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic programming on tree decompositions using generalised fast subset convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 566–577. Springer, Heidelberg (2009)
van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion/exclusion meets measure and conquer: Exact algorithms for counting dominating set. Technical Report UU-CS-2008-043, Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Rooij, J.M.M., Nederlof, J., van Dijk, T.C. (2009). Inclusion/Exclusion Meets Measure and Conquer. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-04128-0_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04127-3
Online ISBN: 978-3-642-04128-0
eBook Packages: Computer ScienceComputer Science (R0)