SPHERE: Spherical partitioning for large-scale routing optimization

Robert Fabian Lindermann, Paul-Niklas Ken Kandora, Simon Caspar Zeller +2

We study shortest-path routing in large weighted, undirected graphs, where expanding search frontiers raise time and memory costs for exact solvers. We propose \emph{SPHERE}, a que…