Polynomial Time Approximation Schemes and Parameterized Complexity.
Jianer ChenXiuzhen HuangIyad A. KanjGe XiaPublished in: MFCS (2004)
Keyphrases
- approximation schemes
- parameterized complexity
- fixed parameter tractable
- approximation algorithms
- np hard
- computational problems
- np complete
- bounded treewidth
- global constraints
- special case
- conjunctive queries
- worst case
- lower bound
- abstract argumentation
- optimal solution
- minimum cost
- image enhancement
- numerical methods
- exact algorithms
- computational complexity
- symmetry breaking
- integer programming
- query evaluation
- constraint satisfaction problems
- denoising
- dynamic programming