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