Keyphrases
- approximation algorithms
- np hard
- greedy algorithm
- worst case
- special case
- minimum cost
- greedy heuristic
- vertex cover
- search algorithm
- set cover
- facility location problem
- dynamic programming
- primal dual
- exact algorithms
- greedy algorithms
- network design problem
- open shop
- randomized algorithms
- constant factor
- polynomial time approximation
- approximation ratio
- np hardness
- lower bound
- disjoint paths
- precedence constraints
- upper bound
- knapsack problem
- search space
- constant factor approximation