Approximation Algorithms for the Bottleneck Stretch Factor Problem.
Giri NarasimhanMichiel H. M. SmidPublished in: STACS (2001)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- facility location problem
- primal dual
- set cover
- open shop
- exact algorithms
- np hardness
- undirected graph
- approximation ratio
- approximation schemes
- disjoint paths
- network design problem
- combinatorial auctions
- constant factor
- precedence constraints