Approximation algorithms for maximum latency and partial cycle cover.
Refael HassinAsaf LevinShlomi RubinsteinPublished in: Discret. Optim. (2009)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- facility location problem
- constant factor
- integrality gap
- primal dual
- network design problem
- open shop
- randomized algorithms
- set cover
- approximation schemes
- np hardness
- approximation guarantees
- lower bound
- constant factor approximation