Abstract
This paper presents a lower bound of qq (D + √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 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) | 253-261 |
| Number of pages | 9 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA Duration: 17 Oct 1999 → 19 Oct 1999 |