Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- worst case
- facility location problem
- vertex cover
- minimum cost
- approximation guarantees
- network design problem
- approximation schemes
- primal dual
- approximation ratio
- np hardness
- graph matching
- randomized algorithms
- probabilistic model
- set cover
- disjoint paths
- precedence constraints
- open shop
- combinatorial auctions
- strongly np hard
- directed graph