Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- facility location problem
- primal dual
- network design problem
- exact algorithms
- open shop
- randomized algorithms
- np hardness
- approximation ratio
- set cover
- undirected graph
- constant factor approximation
- constant factor
- precedence constraints
- polynomial time approximation
- approximation schemes
- disjoint paths
- approximation guarantees
- multistage