Abstract
In the first two sections we explain the fundamentals of subset convolution and the fast algorithm to compute it. To obtain a fast subset convolution algorithm one relies on repeated use of dynamic programming, and in particular on the so-called fast zeta transform. In the latter sections we present various algorithmic applications of fast subset convolution. In this chapter the algorithms (may) operate with large numbers and thus we use the log-cost RAM model to analyze their running times.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cormen, T.H., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, second edn. The MIT Press, Cambridge, Mass. (2001)
Yates, F.: The Design and Analysis of Factorial Experiments. Harpenden (1937)
Knuth, D.E.: The art of computer programming, Vol. 3: Seminumerical algorithms, third edn.Addison-Wesley (1998)
Rota, G.C.: On the foundations of combinatorial theory. I. Theory of Möbius functions. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 2, 340–368 (1964)
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 (STOC 2007), pp. 67–74. ACM (2007)
Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. ACM Trans. Algorithms 5 (1) (2008). Article 9
Riege, T., Rothe, J., Spakowski, H., Yamamoto, M.: An improved exact algorithm for the domatic number problem. Inf. Process. Lett. 101(3), 101–106 (2007)
Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion–exclusion. SIAM J. Comput. 39(2), 546–563 (2009).
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 677–686. IEEE (2008).
Oum, S.i.: Computing rank-width exactly. Inf. Process. Lett. 109(13), 745–748 (2009)
Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52(2), 153–190 (1991)
Oum, S.i., Seymour, P.: Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96(4), 514–528 (2006)
Fomin, F.V., Thilikos, D.M.: Branchwidth of graphs. In: M.Y. Kao (ed.) Encyclopedia of Algorithms. Springer (2008)
Hlinený, P., il Oum, S., Seese, D., Gottlob, G.:Width parameters beyond tree-width and their applications. Comput. J. 51(3), 326–362 (2008)
Fomin, F.V., Mazoit, F., Todinca, I.: Computing branchwidth via efficient triangulations and blocks. Disc. Appl. Math. 157(12), 2726–2736 (2009)
Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: Proceedings of 42th ACM Symposium on Theory of Computing (STOC 2010), pp. 321–330. ACM (2010)
van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic programming on tree decompositions using generalised fast subset convolution. In: Proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009), Lecture Notes in Comput. Sci., vol. 5757, pp. 566–577. 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). Subset Convolution. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-16533-7_7
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)