On the hardness of minimizing space for all-shortest-path interval routing schemes.

Rui Wang Francis C. M. Lau Yan Yan Liu

Published in: Theor. Comput. Sci. (2007)

Keyphrases

shortest path
routing algorithm
shortest path problem
minimal surface
road network
geodesic distance
path selection
shortest path algorithm
path length
routing problem
dijkstra algorithm
shortest distance
optimal path
flow graph
weighted graph
path queries
knapsack problem
search space
finding the shortest path