Paper Info
Title
Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm
Abstract
ABSTRACTThis brief announcement presents an algorithm for (1+ε) approximate single-source shortest paths for directed graphs with non-negative real edge weights in the CONGEST model that runs in Õ ((n^1/2 +D+n^2/5+o(1) D^2/5 )log W / ε^2) rounds, where W is the ratio between the largest and smallest non-zero edge weights.
Year
DOI
Venue
2021
10.1145/3465084.3467945
PODC
Keywords
DocType
Citations 
distributed algorithm, congest model, shortest paths
Conference
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Nairen Cao101.35
Jeremy T. Fineman258736.10
Katina Russell301.35