Faster parallel algorithm for approximate shortest path

DOI10.1145/3357713.3384268OpenAlexW3034415339MaRDI QIDQ5144918

Jason Li

Publication date: 19 January 2021

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

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

zbMATH Keywords

shortest pathparallel algorithmsminimum transshipment

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Minimum cost flow in the CONGEST model ⋮ Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model ⋮ Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique ⋮ Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC

This page was built for publication: Faster parallel algorithm for approximate shortest path