The undirected two disjoint shortest paths problem.

Marinus Gottschau Marcus Kaiser Clara Waldmann

Published in: Oper. Res. Lett. (2019)

Keyphrases

shortest path
weighted graph
shortest path algorithm
shortest path problem
road network
pairwise
shortest distance
routing algorithm
travel time
optimal path
graph partitioning
geodesic distance
directed graph
path length
minimum cost flow
similarity measure
minimal surface
strongly connected components