A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction

David Peleg, Vitaly Rubinovich

Research output: Contribution to journalArticlepeer-review

118 Scopus citations

Abstract

This paper presents a lower bound of Ω(D + √n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter D = Ω(log n), in the bounded message model. This establishes the asymptotic near-optimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D+ √n log* n).

Original languageEnglish
Pages (from-to)1427-1442
Number of pages16
JournalSIAM Journal on Computing
Volume30
Issue number5
DOIs
StatePublished - 2000
Externally publishedYes

Keywords

  • Distributed algorithm
  • Lower bound
  • Minimum weight spanning tree

Fingerprint

Dive into the research topics of 'A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction'. Together they form a unique fingerprint.

Cite this