Abstract
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 k O(k) n O(1), approximation ratio 1/k O(k), and error probability 2-n o(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 [8] applied to fixed parameter tractable problems, and the color-coding technique of Alon, Yuster and Zwick [1]. We also show some W-hardness results for parameterized exact counting problems.
Work supported by a DST-DAAD project (Indo-German Personnel Exchange Programme 2000).
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
N. Alon, R. Yuster and U. Zwick, “Color-Coding”, Journal of the Association for Computing Machinery, 42(4) (1995) 844–856.
H. Bodlaender, “A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth”, SI AM J. Computing 25 (1996) 1305–1317.
R. G. Downey and M. R. Fellows, Parameterized Complexity, Springer-Verlag, 1998.
U. Feige and J. Kilian, “On Limited versus Polynomial Nondeterminism”, Chicago Journal of Theoretical Computer Science, March (1997).
H. Fernau, “Parameterized Enumeration”, to appear in the Proceedings of COCOON 2002.
J. Flum and M. Grohe, “The Parameterized Complexity of Counting Problems”, To appear in 43rd IEEE Symposium on Foundations of Computer Science 2002.
T. Johnson, N. Robertson, P. D. Seymour, R. Thomas, “Directed Tree-Width”, preprint (1998) (available at http://www.math.gatech.edu/#thomas/).
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.
R. M. Karp, M. Luby and N. Madras, “Monte-Carlo Approximation Algorithms for Enumeration Problems”, Journal of Algorithms 10 (1989) 429–448.
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.
T. Kloks, “Treewidth: Computations and Approximations”, Lecture Notes in Computer Science, Springer-Verlag 842 1994.
M. Mahajan and V. Raman, “Parameterizing Above Guaranteed Values: MaxSat and MaxCut”, Journal of Algorithms 31 (1999) 335–354.
C. McCartin, “Parameterized Counting Problems”, to appear in the Proceedings of MFCS 2002 conference.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
N. Nisan, Using Hard Problems to Create Pseudorandom Generators, MIT Press (1992).
P. Rossmanith, private communication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arvind, V., Raman, V. (2002). Approximation Algorithms for Some Parameterized Counting Problems. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_40
Download citation
DOI: https://doi.org/10.1007/3-540-36136-7_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00142-3
Online ISBN: 978-3-540-36136-7
eBook Packages: Springer Book Archive