09511 Executive Summary - Parameterized complexity and approximation algorithms.
Erik D. DemaineMohammadTaghi HajiaghayiDániel MarxPublished in: Parameterized complexity and approximation algorithms (2009)
Keyphrases
- approximation algorithms
- parameterized complexity
- np hard
- fixed parameter tractable
- special case
- minimum cost
- vertex cover
- worst case
- global constraints
- exact algorithms
- approximation ratio
- scheduling problem
- symmetry breaking
- undirected graph
- lower bound
- randomized algorithms
- genetic algorithm
- constant factor
- integer programming
- np complete
- optimal solution
- branch and bound algorithm
- constraint satisfaction problems
- upper bound
- dynamic programming