#### Filter Results:

#### Publication Year

1999

2000

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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… (More)

This paper presents a lower bound of ~ D + p n on the time required for the distributed construction of a minimum-weight spanning tree MST in n-vertex networks of diameter D = log n, in the bounded message model. This establishes the asymp-totic near-optimality of existing time-eecient distributed algorithms for the problem, whose complexity i s OD + p n… (More)

- ‹
- 1
- ›