A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems.
Julia ChuzhoySanjeev KhannaPublished in: STOC (2019)
Keyphrases
- single source
- shortest path problem
- shortest path
- minimum cut
- np hard
- finding the shortest path
- minimum cost flow
- minimum length
- maximum flow
- path length
- benchmark problems
- directed graph
- geodesic distance
- multi source
- combinatorial optimization problems
- shortest path algorithm
- cost function
- bi objective
- optimization problems
- optimal solution
- minimal surface
- optimal path
- dynamic programming