Using a geometric lens to find k disjoint shortest paths.
Matthias BentertAndré NichterleinMalte RenkenPhilipp ZschochePublished in: CoRR (2020)
Keyphrases
- shortest path
- minimal surface
- shortest path algorithm
- shortest path problem
- weighted graph
- optimal path
- road network
- shortest distance
- routing algorithm
- travel time
- path length
- pairwise
- finding the shortest path
- flow graph
- geodesic distance
- minimum cost flow
- edge weights
- geometric structure
- random walk
- reinforcement learning