A deterministic almost-tight distributed algorithm for approximating single-source shortest paths

From MaRDI portal
Publication:5361854

DOI10.1145/2897518.2897638zbMath1375.68218arXiv1504.07056OpenAlexW2952490263MaRDI QIDQ5361854

Sebastian Krinninger, Danupon Nanongkai, Monika R. Henzinger

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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




Related Items (17)




This page was built for publication: A deterministic almost-tight distributed algorithm for approximating single-source shortest paths