Keyphrases
- approximation algorithms
- space complexity
- worst case
- np hard
- upper bound
- search space
- bounded treewidth
- special case
- vertex cover
- boolean functions
- minimum cost
- primal dual
- facility location problem
- np hardness
- exact algorithms
- constant factor
- set cover
- network design problem
- approximation ratio
- open shop
- constant factor approximation
- randomized algorithms
- greedy algorithm
- strongly np hard
- precedence constraints
- lower bound