Meet and merge: approximation algorithms for confluent flows.
Jiangzhuo ChenRajmohan RajaramanRavi SundaramPublished in: STOC (2003)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- facility location problem
- minimum cost
- network design problem
- set cover
- worst case
- np hardness
- approximation schemes
- approximation ratio
- disjoint paths
- open shop
- primal dual
- exact algorithms
- precedence constraints
- randomized algorithms
- scheduling problem
- lower bound
- polynomial time approximation