A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems.
Julia ChuzhoySanjeev KhannaPublished in: CoRR (2019)
Keyphrases
- single source
- shortest path problem
- shortest path
- minimum cut
- finding the shortest path
- minimum cost flow
- combinatorial optimization problems
- shortest path algorithm
- dynamic programming
- benchmark problems
- maximum flow
- minimum length
- routing problem
- multi source
- bi objective
- np hard
- optimal path
- routing algorithm
- flow graph
- data sets