Fast approximation algorithms for routing problems with hop-wise constraints.
Amir ElaloufPublished in: Ann. Oper. Res. (2014)
Keyphrases
- approximation algorithms
- routing problem
- np hard
- resource constraints
- special case
- minimum cost
- precedence constraints
- vertex cover
- vehicle routing problem
- worst case
- primal dual
- set cover
- constant factor
- disjoint paths
- constant factor approximation
- global optimization
- shortest path
- linear constraints
- exact algorithms
- binary variables
- approximation ratio
- randomized algorithms
- undirected graph
- optimal solution
- greedy algorithm
- polynomial time approximation