Parametric shortest-path algorithms via tropical geometry
arXiv:1904.01082 · doi:10.1287/moor.2021.1199
Abstract
We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry. Applications include shortest paths in traffic networks with variable link travel times.
24 pages and 8 figures