Undirected (1+ 𝜀 )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms

DOI10.1145/3519935.3520074arXiv2204.05874WikidataQ130851312 ScholiaQ130851312MaRDI QIDQ6083499

Bernhard Haeupler, Christoph Grunau, Goran Zuzic, Václav Rozhoň, Jason Li

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.05874

zbMATH Keywords

shortest pathparallel algorithmsdistributed algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Routing schemes for hybrid communication networks

This page was built for publication: Undirected (1+ 𝜀 )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms