Undirected $(1+\epsilon )$-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms

Václav Rozhoň, Christoph Grunau, Bernhard Haeupler +2

This paper presents near-optimal deterministic parallel and distributed algorithms for computing $(1+\epsilon )$-approximate single-source shortest paths in any undirected weight…