Meet and merge: Approximation algorithms for confluent flows.
Jiangzhuo ChenRajmohan RajaramanRavi SundaramPublished in: J. Comput. Syst. Sci. (2006)
Keyphrases
- approximation algorithms
- np hard
- special case
- facility location problem
- vertex cover
- worst case
- minimum cost
- disjoint paths
- randomized algorithms
- network design problem
- approximation ratio
- primal dual
- np hardness
- set cover
- open shop
- constant factor
- approximation schemes
- precedence constraints
- learning algorithm
- exact algorithms
- approximation guarantees
- directed graph
- linear programming
- lower bound