Approximation Algorithms for Some Parameterized Counting Problems
We give a randomized fixed parameter tractable algorithm to approximately count the number of copies of a k-vertex graph with bounded treewidth in an n vertex graph. As a consequence, we get randomized algorithms with running time kO(k)nO(1), approximation ratio 1/kO(k), and error probability 2-no(1) for (a) approximately counting the number of matchings of size k in an n vertex graph and (b) approximately counting the number of paths of length k in an n vertex graph. Our algorithm is based on the Karp-Luby approximate counting technique  applied to fixed parameter tractable problems, and the color-coding technique of Alon, Yuster and Zwick . We also show some W-hardness results for parameterized exact counting problems.
Unable to display preview. Download preview PDF.
- 3.R. G. Downey and M. R. Fellows, Parameterized Complexity, Springer-Verlag, 1998.Google Scholar
- 4.U. Feige and J. Kilian, “On Limited versus Polynomial Nondeterminism”, Chicago Journal of Theoretical Computer Science, March (1997).Google Scholar
- 5.H. Fernau, “Parameterized Enumeration”, to appear in the Proceedings of COCOON 2002.Google Scholar
- 6.J. Flum and M. Grohe, “The Parameterized Complexity of Counting Problems”, To appear in 43rd IEEE Symposium on Foundations of Computer Science 2002.Google Scholar
- 7.T. Johnson, N. Robertson, P. D. Seymour, R. Thomas, “Directed Tree-Width”, preprint (1998) (available at http://www.math.gatech.edu/#thomas/).
- 8.R. M. Karp and M. Luby, “Monte-Carlo Algorithms for Enumeration and Reliability Problems”, In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (1983) 56–64.Google Scholar
- 10.S. Khot and V. Raman, “Parameterized Complexity of Finding Subgraphs with Hereditary Properties”, Proceedings of the Sixth Annual International Computing and Combinatorics Conference (COCOON, July 2000, Sydney, Australia, Lecture Notes in Computer Science, Springer Verlag 1858 (2000) 137–147. Full version to appear in Theoretical Computer Science.Google Scholar
- 11.T. Kloks, “Treewidth: Computations and Approximations”, Lecture Notes in Computer Science, Springer-Verlag 842 1994.Google Scholar
- 13.C. McCartin, “Parameterized Counting Problems”, to appear in the Proceedings of MFCS 2002 conference.Google Scholar
- 14.R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.Google Scholar
- 15.N. Nisan, Using Hard Problems to Create Pseudorandom Generators, MIT Press (1992).Google Scholar
- 16.P. Rossmanith, private communication.Google Scholar