Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction.
Leonid KhachiyanVladimir GurvichJihui ZhaoPublished in: CSR (2006)
Keyphrases
- shortest path
- shortest path problem
- optimal path
- path length
- finding the shortest path
- shortest path algorithm
- shortest distance
- weighted graph
- dynamic programming
- maximum flow
- dijkstra algorithm
- social networks
- distance metric
- graph structure
- edge weights
- np hard
- lower bound
- minimum spanning tree
- minimum length
- steiner tree
- minimum cost flow