Polynomial time approximation schemes and parameterized complexity.
Jianer ChenXiuzhen HuangIyad A. KanjGe XiaPublished in: Discret. Appl. Math. (2007)
Keyphrases
- approximation schemes
- parameterized complexity
- fixed parameter tractable
- approximation algorithms
- np hard
- computational problems
- np complete
- bounded treewidth
- special case
- global constraints
- conjunctive queries
- worst case
- exact algorithms
- minimum cost
- computational complexity
- abstract argumentation
- integer programming
- bin packing
- lower bound
- numerical methods
- branch and bound algorithm
- linear programming
- constraint satisfaction problems
- vertex set
- image processing