An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths.

Monika Henzinger Sebastian Krinninger Danupon Nanongkai

Published in: CoRR (2015)

Keyphrases

shortest path problem
single source
shortest path
worst case
finding the shortest path
cost function
shortest path algorithm
optimal path
geodesic distance
shortest distance
minimum cost flow
bi objective
path length
objective function
knapsack problem
dynamic programming
np hard
search space
optimal solution