Approximation Algorithms for Single-Source Unsplittable Flow.
Stavros G. KolliopoulosClifford SteinPublished in: SIAM J. Comput. (2001)
Keyphrases
- approximation algorithms
- single source
- special case
- np hard
- shortest path problem
- multi source
- vertex cover
- worst case
- min cost
- minimum cost
- set cover
- randomized algorithms
- primal dual
- disjoint paths
- network design problem
- precedence constraints
- constant factor approximation
- approximation ratio
- constant factor
- database
- combinatorial auctions
- markov chain
- shortest path