Approximation algorithms for maximum dispersion.
Refael HassinShlomi RubinsteinArie TamirPublished in: Oper. Res. Lett. (1997)
Keyphrases
- approximation algorithms
- special case
- np hard
- minimum cost
- vertex cover
- facility location problem
- worst case
- open shop
- primal dual
- exact algorithms
- constant factor
- network design problem
- randomized algorithms
- np hardness
- approximation schemes
- set cover
- polynomial time approximation
- integrality gap
- undirected graph
- integer programming