Approximation Algorithms for Some Parameterized Counting Problems
Authors:
- 8 November 2002
- book chapter
- Published by Springer Nature
- p. 453-464
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On Parameterized Enumeration2002
- Parameterized Complexity of Finding Subgraphs with Hereditary PropertiesLecture Notes in Computer Science, 2000
- Parameterizing above Guaranteed Values: MaxSat and MaxCutJournal of Algorithms, 1999
- Parameterized Complexity1999
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Randomized Algorithms1995
- Color-codingJournal of the ACM, 1995
- Treewidth1994
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, 1989
- Monte-Carlo algorithms for enumeration and reliability problems1983