v1v2v3v4v5 (latest)

A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths

27 April 2015

Papers citing "A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths"

49 / 49 papers shown

Title
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP M. Ghaffari Anton Trygub 56 4 0 23 Sep 2024
A Survey of Distributed Graph Algorithms on Massive Graphs Lingkai Meng Yu Shao Long Yuan Longbin Lai Peng Cheng Xue Li Wenyuan Yu Wenjie Zhang Xuemin Lin Jingren Zhou 74 15 0 09 Apr 2024
Tight Bounds on the Message Complexity of Distributed Tree Verification S. Kutten Peter Robinson Ming Ming Tan 47 1 0 22 Jan 2024
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs Yi-Jun Chang Danling Zheng 75 1 0 15 Apr 2023
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 55 11 0 14 Feb 2023
Making Self-Stabilizing any Locally Greedy Problem Johanne Cohen Laurence Pilard Mikael Rabie Jonas Sénizergues 45 3 0 31 Aug 2022
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs Taisuke Izumi Naoki Kitamura Takamasa Naruse Gregory Schwartzman 49 5 0 30 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
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity Dariusz R. Kowalski Miguel A. Mosteiro 27 4 0 15 Feb 2022
Distributed $Δ$ -Coloring Plays Hide-and-Seek Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 54 29 0 01 Oct 2021
$(1+ε)$ -Approximate Shortest Paths in Dynamic Streams Michael Elkin Chhaya Trehan 13 1 0 28 Jul 2021
Ultra-Sparse Near-Additive Emulators Michael Elkin Shaked Matar 13 4 0 02 Jun 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm S. Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye 53 22 0 31 Dec 2020
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 69 13 0 10 Nov 2020
Distance Computations in the Hybrid Network Model via Oracle Simulations K. Censor-Hillel Dean Leitersdorf Volodymyr Polosukhin 57 17 0 26 Oct 2020
Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work Michael Elkin Shaked Matar 8 7 0 30 Sep 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 85 30 0 15 Jun 2020
Distributed Weighted Min-Cut in Nearly-Optimal Time Michal Dory Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai 63 22 0 20 Apr 2020
Distributed Lower Bounds for Ruling Sets Alkida Balliu S. Brandt Dennis Olivetti 35 41 0 17 Apr 2020
Busca de melhor caminho entre múltiplas origens e múltiplos destinos em redes complexas que representam cidades Daniel Aragao Abreu Filho HAI 23 0 0 18 Dec 2019
Sparse Hopsets in Congested Clique Yasamin Nazari 17 1 0 17 Nov 2019
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators Alexandr Andoni C. Stein Peilin Zhong 40 56 0 05 Nov 2019
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 44 31 0 04 Sep 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model Taisuke Izumi F. Gall 33 35 0 06 Jun 2019
On the Use of Randomness in Local Distributed Graph Algorithms M. Ghaffari Fabian Kuhn 28 7 0 02 Jun 2019
Deterministic Distributed Dominating Set Approximation in the CONGEST Model Janosch Deurer Fabian Kuhn Yannic Maus 33 26 0 26 May 2019
Distributed Edge Connectivity in Sublinear Time Mohit Daga Monika Henzinger Danupon Nanongkai Thatchaphol Saranurak 55 40 0 08 Apr 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 56 54 0 14 Mar 2019
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time Michael Elkin Shaked Matar 31 21 0 03 Mar 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 49 29 0 07 Jan 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 62 53 0 08 Nov 2018
The Sparsest Additive Spanner via Multiple Weighted BFS Trees Ya-Ping Hsieh Chen Liu Volkan Cevher 43 4 0 05 Nov 2018
Massively Parallel Approximate Distance Sketches M. Dinitz Yasamin Nazari 61 1 0 21 Oct 2018
Deterministic Distributed Ruling Sets of Line Graphs Fabian Kuhn Yannic Maus Simon Weidner 35 26 0 18 May 2018
$A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds$ A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds U. Agarwal V. Ramachandran Valerie King Matteo Pontecorvi 26 38 0 15 Apr 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 88 132 0 22 Feb 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms Bernhard Haeupler Jason Li Goran Zuzic 46 32 0 18 Jan 2018
Improved Distributed Algorithms for Exact Shortest Paths M. Ghaffari Jason Li 60 60 0 25 Dec 2017
A Faster Distributed Single-Source Shortest Paths Algorithm Sebastian Krinninger Danupon Nanongkai 58 66 0 03 Nov 2017
$Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds$ Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds Chien-Chung Huang Danupon Nanongkai Thatchaphol Saranurak 51 45 0 13 Aug 2017
Fast Distributed Approximation for Max-Cut K. Censor-Hillel Rina Levy H. Shachnai 67 10 0 26 Jul 2017
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Talal Riaz Peter Robinson 102 24 0 22 May 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model K. Censor-Hillel Seri Khoury A. Paz 70 55 0 16 May 2017
How Bandwidth Affects the $CONGEST$ Model Dennis Olivetti 26 0 0 20 Apr 2017
Estimation of Graphlet Statistics Ryan A. Rossi R. Zhou Nesreen Ahmed 40 17 0 06 Jan 2017
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems F. Gall 44 48 0 09 Aug 2016
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions K. Censor-Hillel M. Parter Gregory Schwartzman 82 75 0 04 Aug 2016
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees Gopal Pandurangan Peter Robinson Michele Scquizzato 28 54 0 23 Jul 2016
On Efficient Distributed Construction of Near Optimal Routing Schemes Michael Elkin Ofer Neiman 50 26 0 06 Feb 2016