Faster Distributed Shortest Path Approximations via Shortcuts

v1v2v3 (latest)

Faster Distributed Shortest Path Approximations via Shortcuts

11 February 2018

Bernhard Haeupler

ArXiv (abs)PDF HTML

Papers citing "Faster Distributed Shortest Path Approximations via Shortcuts"

17 / 17 papers shown

Title
Model-Agnostic Approximation of Constrained Forest Problems Corinna Coupette Alipasha Montaseri Christoph Lenzen 27 0 0 14 Jul 2024
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 71 2 0 12 Nov 2023
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model Yi-Jun Chang Oren Hecht Dean Leitersdorf 17 0 0 13 Apr 2023
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications Yi-Jun Chang 43 5 0 10 Apr 2023
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances Václav Rozhon Bernhard Haeupler A. Martinsson Christoph Grunau Goran Zuzic 92 14 0 28 Oct 2022
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm Fabien Dufoulon S. Kutten W. Moses Gopal Pandurangan David Peleg 68 5 0 03 Oct 2022
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs Taisuke Izumi Naoki Kitamura Takamasa Naruse Gregory Schwartzman 49 5 0 30 May 2022
$Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions$ Narrowing the LOCAL $\unicode{x2013}$ CONGEST Gaps in Sparse Networks via Expander Decompositions Yi-Jun Chang Hsin-Hao Su 92 10 0 17 May 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
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model Ioannis Anagnostides Themis Gouleakis 44 11 0 03 Aug 2021
Low-Congestion Shortcuts in Constant Diameter Graphs Shimon Kogan M. Parter 28 11 0 03 Jun 2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 55 5 0 25 Apr 2021
Time-Optimal Construction of Overlay Networks Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 43 21 0 08 Sep 2020
Low-Congestion Shortcuts for Graphs Excluding Dense Minors M. Ghaffari Bernhard Haeupler 33 24 0 07 Aug 2020
Low-Congestion Shortcut and Graph Parameters Naoki Kitamura Hirotaka Kitagawa Y. Otachi Taisuke Izumi 34 9 0 26 Aug 2019
Low Congestion Cycle Covers and their Applications M. Parter E. Yogev 28 16 0 09 Dec 2018
A Faster Distributed Single-Source Shortest Paths Algorithm Sebastian Krinninger Danupon Nanongkai 58 66 0 03 Nov 2017