A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation.
Jayadev MisraPublished in: Inf. Process. Lett. (2001)
Keyphrases
- shortest path
- fixed point
- shortest path problem
- shortest path algorithm
- path length
- dynamic programming
- optimal path
- matching algorithm
- finding the shortest path
- learning algorithm
- minimum cost flow
- minimum length
- search space
- optimal solution
- combinatorial optimization
- ant colony optimization
- sufficient conditions
- linear programming
- minimum spanning tree
- np hard
- image segmentation