Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A faster distributed single-source shortest paths algorithm
KTH, School of Electrical Engineering and Computer Science (EECS).
2018 (English)In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, 2018, p. 686-697Conference paper, Published paper (Refereed)
Abstract [en]

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) rounds by Peleg and Rubinovich [SIAM Journal on Computing 2000], where n is the number of nodes in the network and D is its diameter. The state of the art is Elkin's randomized algorithm [STOC 2017] that performs Õ(n2/3D1/3 + n5/6) rounds. We significantly improve upon this upper bound with our two new randomized algorithms for polynomially bounded integer edge weights, the first performing Õ(√nD) rounds and the second performing Õ(√nD1/4 + n3/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 + ϵ) -approximation Õ((√nD1/4 + D)/ϵ)-round algorithm for directed SSSP and a new work/depth trade-off for exact SSSP on directed graphs in the PRAM model.

Place, publisher, year, edition, pages
IEEE Computer Society, 2018. p. 686-697
Series
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, ISSN 0272-5428
Keywords [en]
Distributed algorithms, Shortest paths
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-241527DOI: 10.1109/FOCS.2018.00071ISI: 000455014500062Scopus ID: 2-s2.0-85059812651ISBN: 9781538642306 (print)OAI: oai:DiVA.org:kth-241527DiVA, id: diva2:1281833
Conference
59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7 October 2018 through 9 October 2018
Funder
Swedish Research Council, 2015-04659EU, Horizon 2020, 715672
Note

QC 20190123

Available from: 2019-01-23 Created: 2019-01-23 Last updated: 2019-10-17Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Nanongkai, Danupon
By organisation
School of Electrical Engineering and Computer Science (EECS)
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 3 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf