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

David Peleg; Vitaly Rubinovich

doi:10.1137/s0097539700369740

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

David Peleg
, Vitaly Rubinovich

Weizmann Institute of Science
Bar-Ilan University

Research output: Contribution to journal › Article › peer-review

134 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 language	English
Pages (from-to)	1427-1442
Number of pages	16
Journal	SIAM Journal on Computing
Volume	30
Issue number	5
DOIs	https://doi.org/10.1137/s0097539700369740
State	Published - 2000
Externally published	Yes

Keywords

Distributed algorithm
Lower bound
Minimum weight spanning tree

Access to Document

10.1137/s0097539700369740

Cite this

@article{664a34e7086c4e4b963a3351d1fb5b8b,

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

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).",

keywords = "Distributed algorithm, Lower bound, Minimum weight spanning tree",

author = "David Peleg and Vitaly Rubinovich",

year = "2000",

doi = "10.1137/s0097539700369740",

language = "אנגלית",

volume = "30",

pages = "1427--1442",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "5",

}

TY - JOUR

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

AU - Peleg, David

AU - Rubinovich, Vitaly

PY - 2000

Y1 - 2000

N2 - 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).

AB - 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).

KW - Distributed algorithm

KW - Lower bound

KW - Minimum weight spanning tree

UR - https://www.scopus.com/pages/publications/0035188171

U2 - 10.1137/s0097539700369740

DO - 10.1137/s0097539700369740

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0035188171

SN - 0097-5397

VL - 30

SP - 1427

EP - 1442

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 5

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this