Abstract
Inclusion-exclusion is a fascinating technique used in the design of fast exponential time algorithms. It is based on the inclusion-exclusion principle which is a fundamental counting principle in combinatorics; it allows us to count combinatorial objects in a somewhat indirect way that is applied in particular when direct counting is not possible. This counting principle is the main tool when designing inclusionexclusion algorithms. It seems that this algorithm design paradigm is suited very well to constructing fast exponential time algorithms since it naturally produces exponential time algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Björklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 575–582. IEEE (2006)
Ryser, H.J.: Combinatorial mathematics. The Carus Mathematical Monographs, No. 14. Published by The Mathematical Association of America (1963)
Bax, E.T.: Inclusion and exclusion algorithm for the Hamiltonian path problem. Inf. Process. Lett. 47(4), 203–207 (1993)
Förer, M., Kasiviswanathan, S.P.: Algorithms for counting 2-SAT solutions and colorings with applications. In: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM 2007), Lecture Notes in Comput. Sci., vol. 4508, pp. 47–57. Springer (2007)
Aigner, M.: A course in enumeration, Graduate Texts in Mathematics, vol. 238. Springer, Berlin (2007)
Cameron, P.J.: Combinatorics: topics, techniques, algorithms. Cambridge University Press, Cambridge (1994)
van Lint, J.H., Wilson, R.M.: A course in combinatorics, second edn. Cambridge University Press, Cambridge (2001)
Stanley, R.P.: Enumerative combinatorics. Vol. 1, Cambridge Studies in Advanced Mathematics,vol. 49. Cambridge University Press, Cambridge (1997)
Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the traveling salesman problem. In: Proceedings of the ACM annual conference (ACM 1977), pp. 294–300. ACM Press (1977)
Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1(2), 49–51 (1982)
Bax, E.T.: Algorithms to count paths and cycles. Inf. Process. Lett. 52(5), 249–252 (1994)
Bax, E., Franklin, J.: A finite-difference sieve to count paths and cycles by length. Inf. Process. Lett. 60(4), 171–176 (1996)
Minc, H.: Permanents. Cambridge University Press, New York, NY, USA (1984))
Kawabata, T., Tarui, J.: On complexity of computing the permanent of a rectangular matrix. IECIE Trans. on Fundamentals of Electronics 82(5), 741–744 (1999)
Vassilevska, V., Williams, R.: Finding, minimizing, and counting weighted subgraphs. In: Proceedings of the 41st annual ACM Symposium on Theory of Computing (STOC 2009), pp. 455–464. ACM (2009).
Koivisto, M.: An O(2n) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 583–590. IEEE (2006)
Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion–exclusion. SIAM J. Comput. 39(2), 546–563 (2009).
Nederlof, J.: Fast polynomial-space algorithms using M¨obius inversion: Improving on Steiner tree and related problems. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Lecture Notes in Comput. Sci., vol. 5555, pp. 713–725. Springer (2009)
van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion/exclusion meets measure and conquer. In: Proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009), Lecture Notes in Comput. Sci., vol. 5757, pp. 554–565. Springer (2009)
PA Amini, O., Fomin, F.V., Saurabh, S.: Counting subgraphs via homomorphisms. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Lecture Notes in Comput. Sci., vol. 5555, pp. 71–82. Springer (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fomin, F.V., Kratsch, D. (2010). Inclusion-Exclusion. In: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16533-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-16533-7_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16532-0
Online ISBN: 978-3-642-16533-7
eBook Packages: Computer ScienceComputer Science (R0)