Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths.

Published in: Networks (2007)

Keyphrases

shortest path
minimum cost flow
shortest path algorithm
shortest path problem
road network
weighted graph
travel time
routing algorithm
finding the shortest path
geodesic distance
minimal surface
flow graph
markov chain
path length
shortest distance