Shortest Paths with Bundles and Non-additive Weights Is Hard.

Paul W. Goldberg Antony McCabe

Published in: CIAC (2013)

Keyphrases

shortest path
shortest path algorithm
edge weights
road network
weighted graph
shortest path problem
routing algorithm
optimal path
path length
flow graph
betweenness centrality
geodesic distance
minimum cost flow
finding the shortest path
travel time
random walk
distance transformation
shortest distance