Approximation Algorithms for the Maximum Concurrent Flow Problem.
Farhad ShahrokhiPublished in: INFORMS J. Comput. (1989)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- min cost
- set cover
- approximation ratio
- network design problem
- integrality gap
- randomized algorithms
- facility location problem
- undirected graph
- minimum cost
- constant factor
- approximation schemes
- np hardness
- precedence constraints
- primal dual
- exact algorithms
- approximation guarantees
- open shop
- error bounds
- learning algorithm