A deterministic almost-tight distributed algorithm for approximating single-source shortest paths.
Monika HenzingerSebastian KrinningerDanupon NanongkaiPublished in: STOC (2016)
Keyphrases
- shortest path problem
- single source
- shortest path
- finding the shortest path
- minimum cost flow
- benchmark problems
- shortest path algorithm
- path length
- particle swarm optimization
- dynamic programming
- lower bound
- np hard
- cost function
- databases
- data sets
- network analysis
- combinatorial optimization problems
- simulated annealing