Approximation algorithms for k.
H. Neil GeismarMilind DawandeChelliah SriskandarajahPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- exact algorithms
- primal dual
- network design problem
- facility location problem
- constant factor
- open shop
- set cover
- approximation ratio
- constant factor approximation
- randomized algorithms
- approximation schemes
- undirected graph
- linear program
- np hardness
- upper bound