Approximation Algorithms for the Bottleneck Stretch Factor Problem.
Giri NarasimhanMichiel H. M. SmidPublished in: Nord. J. Comput. (2002)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- minimum cost
- primal dual
- set cover
- open shop
- randomized algorithms
- network design problem
- facility location problem
- approximation schemes
- exact algorithms
- approximation ratio
- np hardness
- precedence constraints
- polynomial time approximation
- combinatorial auctions
- constant factor