Parameterized Approximation Problems
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 121-129
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The Parameterized Complexity of Counting ProblemsSIAM Journal on Computing, 2004
- Online Problems, Pathwidth, and Persistence2004
- Parameterized Complexity1999
- On the efficiency of polynomial time approximation schemesInformation Processing Letters, 1997