Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows.
Fabrizio GrandoniSalvatore IngalaSumedha UniyalPublished in: WAOA (2015)
Keyphrases
- approximation algorithms
- minimum cost
- np hard
- special case
- vertex cover
- disjoint paths
- facility location problem
- np hardness
- network design problem
- worst case
- min cost
- approximation ratio
- primal dual
- vehicle routing
- precedence constraints
- constant factor
- set cover
- undirected graph
- randomized algorithms
- approximation schemes
- open shop
- genetic algorithm
- constant factor approximation
- approximation guarantees
- combinatorial optimization