Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm

Berenike Masing, Niels Lindner, Enrico Bortoletto

Given a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account? This question lea…