Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- clustering method
- network design problem
- k means
- facility location problem
- set cover
- clustering algorithm
- exact algorithms
- randomized algorithms
- primal dual
- disjoint paths
- approximation ratio
- approximation schemes
- precedence constraints
- open shop
- constant factor
- strongly np hard
- np hardness
- undirected graph
- lower bound