Invitation to Algorithmic Uses of Inclusion–Exclusion

  • Thore Husfeldt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6756)


I give an introduction to algorithmic uses of the principle of inclusion–exclusion. The presentation is intended to be be concrete and accessible, at the expense of generality and comprehensiveness.


Dynamic Programming Perfect Matchings Travel Salesman Problem Steiner Tree Graph Colouring 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. Assoc. Comput. Mach. 9(1), 61–63 (1962)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Björklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52(2), 226–249 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, CA, June 11-13, pp. 67–74. ACM, New York (2007)Google Scholar
  4. 4.
    Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Covering and packing in linear space. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 727–737. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Evaluation of permanents in rings and semirings. Inf. Process. Lett. 110(20), 867–870 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings. arXiv:1007.1161 (2010)Google Scholar
  7. 7.
    Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed Moebius inversion and graphs of bounded degree. Theory Comput. Syst. 47(3), 637–654 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion–exclusion. SIAM J. Comput. 39(2), 546–563 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    DeMillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inform. Process Lett. 7, 193–195 (1978)CrossRefzbMATHGoogle Scholar
  10. 10.
    Fomin, F., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. Springer, Heidelberg (2010)CrossRefzbMATHGoogle Scholar
  11. 11.
    Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math. 10, 196–210 (1962)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1(2), 49–51 (1981-1982)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Knuth, D.E.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol. 2. Addison-Wesley, Upper Saddle River (1998)zbMATHGoogle Scholar
  14. 14.
    Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the traveling salesman problem. In: Proceedings of the 1977 ACM Annual Conference, Seattle, WA, October 17-19, pp. 294–300. ACM, New York (1977)Google Scholar
  15. 15.
    Lawler, E.L.: A note on the complexity of the chromatic number problem. Inf. Process. Lett. 5(3), 66–67 (1976)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Nederlof, J.: Fast polynomial-space algorithms using Möbius inversion: Improving on Steiner tree and related problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 713–725. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  17. 17.
    Ryser, H.J.: Combinatorial Mathematics. The Carus Mathematical Monographs, vol. 14. The Mathematical Association of America, Washington, D.C. (1963)zbMATHGoogle Scholar
  18. 18.
    Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27, 701–717 (1980)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thore Husfeldt
    • 1
    • 2
  1. 1.IT University of CopenhagenDenmark
  2. 2.Lund UniversitySweden

Personalised recommendations