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

Authors:
David Peleg;Vitaly Rubinovich
Affiliations:
-;-
Venue:
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Year:
1999

Citing 6
Cited 10

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Time-optimal leader election in general networks

Journal of Parallel and Distributed Computing
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees

SIAM Journal on Computing
Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributive graph algorithms Global solutions from local data

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

A faster distributed protocol for constructing a minimum spanning tree

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Distributed approximation: a survey

ACM SIGACT News
A faster distributed protocol for constructing a minimum spanning tree

Journal of Computer and System Sciences
Local MST computation with short advice

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Efficient distributed approximation algorithms via probabilistic tree embeddings

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Theory of communication networks

Algorithms and theory of computation handbook
Tight bounds for parallel randomized load balancing: extended abstract

Proceedings of the forty-third annual ACM symposium on Theory of computing
A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs

The Journal of Supercomputing
A fast distributed approximation algorithm for minimum spanning trees

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

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.