Approximation algorithms for some parameterized counting problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 453-464

  Arvind, V ^a   Raman, Venkatesh ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE COUNTING; APPROXIMATION RATIOS; BOUNDED TREEWIDTH; COUNTING PROBLEMS; ERROR PROBABILITIES; FIXED-PARAMETER TRACTABLE ALGORITHMS; N-VERTEX GRAPH; RANDOMIZED ALGORITHMS; HARDNESS RESULT;

GRAPH THEORY; PARAMETER ESTIMATION; ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84878638621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_40     Document Type: Conference Paper

References (16)

1. N. Alon, R. Yuster and U. Zwick, "Color-Coding", Journal of the Association for Computing Machinery, 42(4) (1995) 844-856.
2. H. Bodlaender, "A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth", SIAM J. Computing 25 (1996) 1305-1317. (Pubitemid 126584672)
3. R. G. Downey and M. R. Fellows, Parameterized Complexity, Springer-Verlag, 1998.
4. U. Feige and J. Kilian, "On Limited versus Polynomial Nondeterminism", Chicago Journal of Theoretical Computer Science, March (1997).
5. H. Fernau, "Parameterized Enumeration", to appear in the Proceedings of CO-COON2002.
6. J. Flum and M. Grohe, "The Parameterized Complexity of Counting Problems", To appear in 43rd IEEE Symposium on Foundations of Computer Science 2002.
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. (Pubitemid 14462504)
9. R. M. Karp, M. Luby and N. Madras, "Monte-Carlo Approximation Algorithms for Enumeration Problems", Journal of Algorithms 10 (1989) 429-448.
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.
11. T. Kloks, "Treewidth: Computations and Approximations", Lecture Notes in Computer Science, Springer-Verlag 842 1994.
12. M. Mahajan and V. Raman, "Parameterizing Above Guaranteed Values: MaxSat and MaxCut", Journal of Algorithms 31 (1999) 335-354. (Pubitemid 129610428)
13. C. McCartin, "Parameterized Counting Problems", to appear in the Proceedings of MFCS 2002 conference.
14. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
15. N. Nisan, Using Hard Problems to Create Pseudorandom Generators, MIT Press (1992).
16. P. Rossmanith, private communication.