Article

A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction

Authors:

David Peleg,

Vitaly RubinovichAuthors Info & Claims

FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Page 253

Published: 17 October 1999 Publication History

Publisher Site

Abstract

This paper presents a lower bound of \math\math on the time required for the distributed construction of a minimum-weight spanning tree (MST) in n-vertex networks of diameter \math, in the bounded message model. This establishes the asymptotic near-optimality of existing time-efficient distributed algorithms for the problem, whose complexity is \math.

References

[1]

B. Awerbuch, Optimal distributed algorithms for minimum-weight spanning tree, counting, leader election and related problems, Proc. 19th Symp. on Theory of Computing, pp. 230-240, May 1987.

Digital Library

Google Scholar

[2]

R. Gallager, P. Humblet and P. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Transactions on Programming Languages and Systems, Vol. 5 (1), (1983), 66-77.

Digital Library

Google Scholar

[3]

J. Garay, S. Kutten and D. Peleg, A sub-linear time distributed algorithm for minimum-weight spanning trees, SIAM J. on Computing Vol. 27, (1998), 302-316.

Digital Library

Google Scholar

[4]

S. Kutten and D. Peleg, Fast distributed construction of small k-dominating sets and applications, J. of Algorithms, Vol. 28, (1998), pages 40-66.

Digital Library

Google Scholar

[5]

N. Linial, Distributive graph algorithms - global solutions from local data, Proc. 28th IEEE Symp. on Foundations of Computer Science, pp. 331-335, October 1987.

Digital Library

Google Scholar

[6]

D. Peleg, Time-optimal leader election in general networks, Journal of Parallel and Distributed Computing, Vol. 8, pp. 96-99, 1990.

Digital Library

Google Scholar

Cited By

View all

Chechik SMukhtar DEmek YCachin C(2020)Single-Source Shortest Paths in the CONGEST Model with Improved BoundProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3405729(464-473)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3405729
Efron YGrossman OKhoury SEmek YCachin C(2020)Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGESTProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3405702(511-520)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3405702
Agarwal URamachandran VKing VPontecorvi MNewport CKeidar I(2018)A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) RoundsProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212773(199-205)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212773
Show More Cited By

A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis

Recommendations

A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction

This paper presents a lower bound of $\Omega(D+\sqrt 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=\Omega(\log n)$, in the bounded message model. ...
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
Rigidity and the Lower Bound Theorem for Doubly Cohen---Macaulay Complexes

We prove that for dź3, the 1-skeleton of any (dź1)-dimensional doubly Cohen---Macaulay (abbreviated 2-CM) complex is generically d-rigid. This implies that Barnette's lower bound inequalities for boundary complexes of simplicial polytopes (Barnette, D. ...

Comments

Information & Contributors

Information

Published In

FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science

October 1999

ISBN:0769504094

Publisher

IEEE Computer Society

United States

Publication History

Published: 17 October 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chechik SMukhtar DEmek YCachin C(2020)Single-Source Shortest Paths in the CONGEST Model with Improved BoundProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3405729(464-473)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3405729
Efron YGrossman OKhoury SEmek YCachin C(2020)Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGESTProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3405702(511-520)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3405702
Agarwal URamachandran VKing VPontecorvi MNewport CKeidar I(2018)A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) RoundsProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212773(199-205)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212773
Ghaffari MLi JDiakonikolas IKempe DHenzinger M(2018)Improved distributed algorithms for exact shortest pathsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188948(431-444)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188948
Censor-Hillel KKavitha TPaz AYehudayoff A(2018)Distributed construction of purely additive spannersDistributed Computing10.1007/s00446-017-0306-231:3(223-240)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s00446-017-0306-2
Elkin MHatami HMcKenzie PKing V(2017)Distributed exact shortest paths in sublinear timeProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3055399.3055452(757-770)Online publication date: 19-Jun-2017
https://dl.acm.org/doi/10.1145/3055399.3055452
Ghaffari MHaeupler B(2016)Distributed algorithms for planar networks IIProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884451(202-219)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884451
Ghaffari MParter MScheideler CGilbert S(2016)Near-Optimal Distributed Algorithms for Fault-Tolerant Tree StructuresProceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/2935764.2935795(387-396)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1145/2935764.2935795
Haeupler BIzumi TZuzic GGiakkoupis G(2016)Low-Congestion Shortcuts without EmbeddingProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933112(451-460)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2933057.2933112
Ghaffari MHaeupler BGiakkoupis G(2016)Distributed Algorithms for Planar Networks IProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933109(29-38)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2933057.2933109
Show More Cited By

Abstract

References

Cited By

Recommendations

A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction