Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees.
Khaled M. ElbassioniNaveen GargDivya GuptaAmit KumarVishal NarulaArindam PalPublished in: FSTTCS (2012)
Keyphrases
- approximation algorithms
- disjoint paths
- np hard
- special case
- minimum cost
- min cost
- worst case
- facility location problem
- vertex cover
- set cover
- network design problem
- precedence constraints
- approximation schemes
- shortest path
- primal dual
- randomized algorithms
- open shop
- np hardness
- exact algorithms
- approximation ratio
- constant factor
- lower bound
- search algorithm
- integrality gap
- tree structure
- computational complexity