Approximation Algorithms for Some Routing Problems.
Greg N. FredericksonMatthew S. HechtChul E. KimPublished in: SIAM J. Comput. (1978)
Keyphrases
- approximation algorithms
- routing problem
- np hard
- special case
- vehicle routing problem
- vertex cover
- minimum cost
- worst case
- routing algorithm
- primal dual
- approximation ratio
- vehicle routing
- resource constraints
- set cover
- exact algorithms
- constant factor
- constant factor approximation
- shortest path
- precedence constraints
- global optimization
- traveling salesman problem
- randomized algorithms
- disjoint paths
- lower bound
- undirected graph
- travel time
- polynomial time approximation