Shortest Paths in a Hybrid Network Model

DOI10.1137/1.9781611975994.78MaRDI QIDQ5146850zbMATH OpenOpenAlexFDO

Authors Kristian Hinnenthal, Fabian Kuhn, Philipp Schneider, John Augustine, Christian Scheideler

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(8)

• Network-Tree Model and Shortest Path Algorithm
• Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
• Distributed computing with the Cloud
• Distributed Computing with the Cloud
• Universally optimal information dissemination and shortest paths in the HYBRID distributed model
• Polylogarithmic time algorithms for shortest path forests in programmable matter
• Distance computations in the hybrid network model via oracle simulations
• Polylogarithmic time algorithms for shortest path forests in programmable matter

This page was built for publication: Shortest Paths in a Hybrid Network Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146850)