Shortest Paths in a Hybrid Network Model

DOI10.1137/1.9781611975994.78OpenAlexW3001053786MaRDI QIDQ5146850

Kristian Hinnenthal, Fabian Kuhn, Philipp Schneider, John E. 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)

Related Items (4)

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts ⋮ Time-optimal construction of overlay networks ⋮ Distributed computing with the Cloud ⋮ Routing schemes for hybrid communication networks

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