Improved Approximation Algorithms for Unsplittable Flow Problems.
Stavros G. KolliopoulosClifford SteinPublished in: FOCS (1997)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- randomized algorithms
- exact algorithms
- worst case
- approximation schemes
- optimization problems
- np complete
- np hardness
- special case
- minimum cost
- lower bound
- primal dual
- precedence constraints
- computational complexity
- greedy algorithms
- approximation ratio
- mathematical model
- polynomial time approximation
- evolutionary algorithm