Using a Geometric Lens to Find k Disjoint Shortest Paths.
Matthias BentertAndré NichterleinMalte RenkenPhilipp ZschochePublished in: ICALP (2021)
Keyphrases
- shortest path
- minimal surface
- shortest path algorithm
- shortest path problem
- pairwise
- road network
- weighted graph
- routing algorithm
- travel time
- path length
- flow graph
- geometric structure
- finding the shortest path
- optimal path
- minimum cost flow
- shortest distance
- spatial networks
- strongly connected components
- optimal solution