The complexity of shortest path and dilation bounded interval routing.
Rastislav KralovicPeter RuzickaDaniel StefankovicPublished in: Theor. Comput. Sci. (2000)
Keyphrases
- shortest path
- routing algorithm
- shortest path problem
- road network
- shortest path algorithm
- routing problem
- path selection
- dijkstra algorithm
- shortest distance
- weighted graph
- travel time
- flow graph
- source node
- geodesic distance
- mathematical morphology
- minimum spanning tree
- minimum length
- path queries
- morphological operations
- optimal solution
- ad hoc networks
- sensor networks
- multi objective