Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem.
Jingde DuStavros G. KolliopoulosPublished in: WEA (2004)
Keyphrases
- approximation algorithms
- single source
- np hard
- special case
- shortest path problem
- multi source
- min cost
- vertex cover
- network design problem
- worst case
- primal dual
- open shop
- set cover
- approximation ratio
- precedence constraints
- minimum cost
- randomized algorithms
- constant factor approximation
- constant factor
- combinatorial auctions
- databases
- disjoint paths
- data sets