On Fixed-Parameter Tractability and Approximability of NP Optimization Problems.
Liming CaiJianer ChenPublished in: J. Comput. Syst. Sci. (1997)
Keyphrases
- optimization problems
- np hard
- fixed parameter tractability
- approximation algorithms
- evolutionary algorithm
- metaheuristic
- np complete
- objective function
- cost function
- fixed parameter tractable
- single peaked
- computational complexity
- combinatorial optimization
- knapsack problem
- optimal solution
- traveling salesman problem
- integer programming
- worst case
- simulated annealing
- database systems
- decision problems
- lower bound