Lower Bounds for Shortest Path Interval Routing.
Cyril GavoilleStephane PerennesPublished in: SIROCCO (1996)
Keyphrases
- shortest path
- lower bound
- routing algorithm
- upper bound
- shortest path problem
- path selection
- routing problem
- branch and bound
- road network
- branch and bound algorithm
- lagrangian relaxation
- lower and upper bounds
- shortest path algorithm
- optimal solution
- dijkstra algorithm
- path length
- optimal path
- weighted graph
- objective function
- np hard
- travel time
- finding the shortest path
- geodesic distance
- source node
- shortest distance
- wireless networks
- path queries
- steiner tree
- flow graph
- shortest path routing