Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- objective function
- special case
- vertex cover
- knapsack problem
- worst case
- primal dual
- optimal solution
- dynamic programming
- minimum cost
- set cover
- approximation ratio
- facility location problem
- greedy algorithm
- feasible solution
- disjoint paths
- exact algorithms
- constant factor
- undirected graph
- np hardness
- approximation schemes
- polynomial time approximation
- greedy heuristic
- randomized algorithms
- network design problem
- combinatorial auctions
- open shop
- upper bound
- constraint satisfaction problems
- energy minimization