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"

16 / 16 papers shown

Title
Minor Sparsifiers and the Distributed Laplacian Paradigm S. Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye 38 20 0 31 Dec 2020
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 38 9 0 10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 14 31 0 15 Jun 2020
Distributed Weighted Min-Cut in Nearly-Optimal Time Michal Dory Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai 41 21 0 20 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 13 0 0 18 Dec 2019
On the Use of Randomness in Local Distributed Graph Algorithms M. Ghaffari Fabian Kuhn 21 7 0 02 Jun 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 17 53 0 14 Mar 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 20 29 0 07 Jan 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 16 49 0 08 Nov 2018
The Sparsest Additive Spanner via Multiple Weighted BFS Trees Ya-Ping Hsieh Chen Liu V. Cevher 12 4 0 05 Nov 2018
Massively Parallel Approximate Distance Sketches M. Dinitz Yasamin Nazari 11 1 0 21 Oct 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 11 37 0 15 Apr 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms Bernhard Haeupler Jason Li Goran Zuzic 27 32 0 18 Jan 2018
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model K. Censor-Hillel Seri Khoury A. Paz 31 55 0 16 May 2017
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems F. Gall 14 48 0 09 Aug 2016
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model Maleq Khan V. S. Anil Kumar Gopal Pandurangan Guanhong Pei 93 109 0 06 Jun 2012