Approximation Algorithms for the Unsplittable Flow Problem.
Amit ChakrabartiChandra ChekuriAnupam GuptaAmit KumarPublished in: Algorithmica (2007)
Keyphrases
- approximation algorithms
- np hard
- special case
- min cost
- worst case
- vertex cover
- set cover
- facility location problem
- network design problem
- primal dual
- precedence constraints
- np hardness
- randomized algorithms
- approximation ratio
- minimum cost
- constant factor
- exact algorithms
- disjoint paths
- open shop
- approximation schemes
- undirected graph