Shortest path with acceleration constraints: complexity and approximation algorithms.
Stefano ArdizzoniLuca ConsoliniMattia LauriniMarco LocatelliPublished in: Comput. Optim. Appl. (2022)
Keyphrases
- shortest path
- approximation algorithms
- worst case
- np hardness
- special case
- shortest path problem
- np hard
- precedence constraints
- vertex cover
- shortest path algorithm
- road network
- minimum cost
- weighted graph
- primal dual
- routing algorithm
- travel time
- path length
- randomized algorithms
- upper bound
- optimal path
- constant factor
- shortest distance
- lower bound
- approximation ratio
- lagrangian relaxation
- lower and upper bounds
- undirected graph
- greedy algorithm
- computational complexity