A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.
Monika HenzingerSebastian KrinningerDanupon NanongkaiPublished in: SIAM J. Comput. (2021)
Keyphrases
- shortest path problem
- single source
- shortest path
- shortest path algorithm
- worst case
- cost function
- simulated annealing
- multi source
- optimal solution
- minimum cost flow
- np hard
- dynamic programming
- finding the shortest path
- path planning
- benchmark problems
- ant colony optimization
- optimal path
- particle swarm optimization
- bi objective
- evolutionary algorithm
- search space
- moving objects
- lower bound