Shortest Paths in a Hybrid Network Model

Shortest Paths in a Hybrid Network Model

4 September 2019

John E. Augustine

Kristian Hinnenthal

Christian Scheideler

ArXiv (abs)PDF HTML

Papers citing "Shortest Paths in a Hybrid Network Model"

18 / 18 papers shown

Title
Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter Andreas Padalkin Christian Scheideler 51 3 0 19 Feb 2024
Byzantine Resilient Computing with the Cloud Songlin Wei JIazhao Zhang Shachar Meir David Peleg Srikkanth Ramachandran He Wang 41 0 0 28 Sep 2023
Towards Universally Optimal Shortest Paths Algorithms in the Hybrid Model P. Schneider 43 0 0 09 Jun 2023
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model Yi-Jun Chang Oren Hecht Dean Leitersdorf 17 0 0 13 Apr 2023
Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks Neta Rozen Schiff Klaus-Tycho Foerster Stefan Schmid David Hay 134 6 0 11 Nov 2022
Routing Schemes for Hybrid Communication Networks Samantha R. Coy A. Czumaj Christian Scheideler P. Schneider Julian Werthmann 28 3 0 11 Oct 2022
Computing Power of Hybrid Models in Synchronous Networks Pierre Fraigniaud Pedro Montealegre Pablo Paredes I. Rapaport Martín Ríos-Wilson Ioan Todinca 50 2 0 04 Aug 2022
$Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms$ Undirected $(1+\varepsilon)$ -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms Václav Rozhon Christoph Grunau Bernhard Haeupler Goran Zuzic Jason Li 51 29 0 12 Apr 2022
Near-Shortest Path Routing in Hybrid Communication Networks Samantha R. Coy A. Czumaj Michel Feldmann Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider Martijn Struijs 27 13 0 16 Feb 2022
Routing Schemes and Distance Oracles in the Hybrid Model Fabian Kuhn P. Schneider 18 10 0 14 Feb 2022
Distributed Computing With the Cloud Y. Afek Gal Giladi B. Patt-Shamir 62 7 0 27 Sep 2021
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts Ioannis Anagnostides Christoph Lenzen Bernhard Haeupler Goran Zuzic Themis Gouleakis 60 8 0 11 Sep 2021
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model Ioannis Anagnostides Themis Gouleakis 44 11 0 03 Aug 2021
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths Xiaojun Dong Yan Gu Yihan Sun Yunming Zhang 58 33 0 13 May 2021
Distance Computations in the Hybrid Network Model via Oracle Simulations K. Censor-Hillel Dean Leitersdorf Volodymyr Polosukhin 57 17 0 26 Oct 2020
Time-Optimal Construction of Overlay Networks Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 48 21 0 08 Sep 2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs Michel Feldmann Kristian Hinnenthal Christian Scheideler 44 22 0 02 Jul 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 88 30 0 15 Jun 2020