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. 1802.03671
  4. Cited By
Faster Distributed Shortest Path Approximations via Shortcuts
v1v2v3 (latest)

Faster Distributed Shortest Path Approximations via Shortcuts

11 February 2018
Bernhard Haeupler
Jason Li
ArXiv (abs)PDFHTML

Papers citing "Faster Distributed Shortest Path Approximations via Shortcuts"

4 / 4 papers shown
Title
Fast Partial Distance Estimation and Applications
Fast Partial Distance Estimation and Applications
Christoph Lenzen
B. Patt-Shamir
46
62
0
26 Dec 2014
Almost-Tight Distributed Minimum Cut Algorithms
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai
Hsin-Hao Su
83
54
0
04 Aug 2014
Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and
  Low-Stretch Subgraphs
Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs
G. Blelloch
Anupam Gupta
I. Koutis
Gary Miller
Richard Peng
Kanat Tangwongsan
74
34
0
07 Nov 2011
Distributed Verification and Hardness of Distributed Approximation
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma
S. Holzer
Liah Kor
Amos Korman
Danupon Nanongkai
Gopal Pandurangan
David Peleg
Roger Wattenhofer
85
346
0
12 Nov 2010
1