Login / Signup
The complexity of an inverse shortest paths problem.
Sándor P. Fekete
Winfried Hochstättler
Stephan Kromberg
Christoph Moll
Published in:
Contemporary Trends in Discrete Mathematics (1997)
Keyphrases
</>
shortest path
shortest path problem
shortest path algorithm
road network
worst case
finding the shortest path
path length
decision problems
travel time
routing algorithm
minimum length
minimum cost flow
strongly connected components
weighted graph
minimal surface
flow graph
shortest distance
lower bound