Approximation algorithms for mixed, windy, and capacitated arc routing problems.
René van BevernChristian KomusiewiczManuel SorgePublished in: CoRR (2015)
Keyphrases
- approximation algorithms
- routing problem
- network design problem
- np hard
- facility location problem
- special case
- worst case
- minimum cost
- vertex cover
- vehicle routing problem
- np hardness
- primal dual
- open shop
- constant factor
- scheduling problem
- precedence constraints
- approximation schemes
- set cover
- lower bound
- approximation ratio
- lot sizing
- optimal solution
- knapsack problem
- single machine
- traveling salesman problem
- randomized algorithms
- linear program
- shortest path
- linear programming
- constant factor approximation