ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1911.01626
  4. Cited By
Faster Parallel Algorithm for Approximate Shortest Path
v1v2v3v4v5v6 (latest)

Faster Parallel Algorithm for Approximate Shortest Path

5 November 2019
Jason Li
ArXiv (abs)PDFHTML

Papers citing "Faster Parallel Algorithm for Approximate Shortest Path"

13 / 13 papers shown
Title
Massively Parallel Algorithms for Approximate Shortest Paths
Massively Parallel Algorithms for Approximate Shortest Paths
Michal Dory
Shaked Matar
99
1
0
09 Dec 2024
Efficient parallel implementation of the multiplicative weight update
  method for graph-based linear programs
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs
Caleb Ju
Serif Yesil
Mengyuan Sun
C. Chekuri
Edgar Solomonik
32
0
0
06 Jul 2023
CQLite: Communication-Efficient Multi-Robot Exploration Using
  Coverage-biased Distributed Q-Learning
CQLite: Communication-Efficient Multi-Robot Exploration Using Coverage-biased Distributed Q-Learning
Ehsan Latif
Ramviyas Parasuraman
119
9
0
02 Jul 2023
Parallel Breadth-First Search and Exact Shortest Paths and Stronger
  Notions for Approximate Distances
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
97
14
0
28 Oct 2022
Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates:
  Near-Optimal Deterministic Parallel & Distributed Algorithms
Undirected (1+ε)(1+\varepsilon)(1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms
Václav Rozhon
Christoph Grunau
Bernhard Haeupler
Goran Zuzic
Jason Li
58
29
0
12 Apr 2022
$\ell_2$-norm Flow Diffusion in Near-Linear Time
ℓ2\ell_2ℓ2​-norm Flow Diffusion in Near-Linear Time
Li Chen
Richard Peng
Di Wang
26
0
0
30 May 2021
Efficient Stepping Algorithms and Implementations for Parallel Shortest
  Paths
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Xiaojun Dong
Yan Gu
Yihan Sun
Yunming Zhang
58
33
0
13 May 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm
Minor Sparsifiers and the Distributed Laplacian Paradigm
S. Forster
Gramoz Goranci
Yang P. Liu
Richard Peng
Xiaorui Sun
Mingquan Ye
62
22
0
31 Dec 2020
Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time
  and Slightly Super-Linear Work
Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work
Michael Elkin
Shaked Matar
10
7
0
30 Sep 2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Michel Feldmann
Kristian Hinnenthal
Christian Scheideler
44
22
0
02 Jul 2020
Massively Parallel Algorithms for Distance Approximation and Spanners
Massively Parallel Algorithms for Distance Approximation and Spanners
Amartya Shankha Biswas
Michal Dory
M. Ghaffari
Slobodan Mitrović
Yasamin Nazari
76
20
0
02 Mar 2020
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Alexandr Andoni
C. Stein
Peilin Zhong
45
56
0
05 Nov 2019
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and
  Scalable
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala
G. Blelloch
Julian Shun
GNN
86
150
0
14 May 2018
1