CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
A Faster Distributed Single-Source Shortest Paths Algorithm
Authors
Sebastian Forster
Danupon Nanongkai
Publication date
31 July 2019
Publisher
'Institute of Electrical and Electronics Engineers (IEEE)'
Doi
Cite
View
on
arXiv
Abstract
We devise new algorithms for the single-source shortest paths (SSSP) problem with non-negative edge weights in the CONGEST model of distributed computing. While close-to-optimal solutions, in terms of the number of rounds spent by the algorithm, have recently been developed for computing SSSP approximately, the fastest known exact algorithms are still far away from matching the lower bound of
Ω
~
(
n
+
D
)
\tilde \Omega (\sqrt{n} + D)
Ω
~
(
n
​
+
D
)
rounds by Peleg and Rubinovich [SIAM Journal on Computing 2000], where
n
n
n
is the number of nodes in the network and
D
D
D
is its diameter. The state of the art is Elkin's randomized algorithm [STOC 2017] that performs
O
~
(
n
2
/
3
D
1
/
3
+
n
5
/
6
)
\tilde O(n^{2/3} D^{1/3} + n^{5/6})
O
~
(
n
2/3
D
1/3
+
n
5/6
)
rounds. We significantly improve upon this upper bound with our two new randomized algorithms for polynomially bounded integer edge weights, the first performing
O
~
(
n
D
)
\tilde O (\sqrt{n D})
O
~
(
n
D
​
)
rounds and the second performing
O
~
(
n
D
1
/
4
+
n
3
/
5
+
D
)
\tilde O (\sqrt{n} D^{1/4} + n^{3/5} + D)
O
~
(
n
​
D
1/4
+
n
3/5
+
D
)
rounds. Our bounds also compare favorably to the independent result by Ghaffari and Li [STOC 2018]. As side results, we obtain a
(
1
+
ϵ
)
(1 + \epsilon)
(
1
+
ϵ
)
-approximation
O
~
(
(
n
D
1
/
4
+
D
)
/
ϵ
)
\tilde O ((\sqrt{n} D^{1/4} + D) / \epsilon)
O
~
((
n
​
D
1/4
+
D
)
/
ϵ
)
-round algorithm for directed SSSP and a new work/depth trade-off for exact SSSP on directed graphs in the PRAM model.Comment: Presented at the the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018
Similar works
Full text
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 10/08/2021