Faster Deterministic All Pairs Shortest Paths in Congest Model

19 May 2020

Papers citing "Faster Deterministic All Pairs Shortest Paths in Congest Model"

10 / 10 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
Distributed Deterministic Exact Minimum Weight Cycle and Multi Source Shortest Paths in Near Linear Rounds in CONGEST model U. Agarwal 16 1 0 01 Oct 2023
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model Vignesh Manoharan V. Ramachandran 39 3 0 16 Aug 2023
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model Vignesh Manoharan V. Ramachandran 59 4 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
Collaborative Learning in General Graphs with Limited Memorization: Complexity, Learnability, and Reliability Feng Li Xuyang Yuan Lina Wang Huan Yang Dongxiao Yu Weifeng Lv Xiuzhen Cheng 39 4 0 29 Jan 2022
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
The Sparsest Additive Spanner via Multiple Weighted BFS Trees Ya-Ping Hsieh Chen Liu Volkan Cevher 43 4 0 05 Nov 2018