On Parameterized Approximability
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 109-120
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Clique-width minimization is NP-hard2006
- The PCP theorem by gap amplification2006
- Context-free handle-rewriting hypergraph grammars2005
- Approximating Rank-Width and Clique-Width QuicklyLecture Notes in Computer Science, 2005
- Parameterized Complexity1999
- Approximating Minimum Feedback Sets and Multicuts in Directed GraphsAlgorithmica, 1998
- Probabilistic checking of proofsJournal of the ACM, 1998
- On the parameterized complexity of short computation and factorizationArchive for Mathematical Logic, 1997
- Computation Models for Parameterized ComplexityMathematical Logic Quarterly, 1997
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995