Minimum-weight spanning tree construction in O(log log n) communication rounds

Zvi Lotker*, Boaz Patt-Shamir, Elan Pavlov, David Peleg

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We consider a simple model for overlay networks, where all n processes are connected to all other processes, and each message contains at most O(log n) bits. For this model, we present a distributed algorithm which constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to every other process. If message size is Θ(ne) for some ε > 0, then the number of communication rounds is O(log 1/ε).

Original languageEnglish
Pages (from-to)120-131
Number of pages12
JournalSIAM Journal on Computing
Issue number1
StatePublished - 2006


  • Distributed algorithms
  • Minimum-weight spanning tree


Dive into the research topics of 'Minimum-weight spanning tree construction in O(log log n) communication rounds'. Together they form a unique fingerprint.

Cite this