STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Data networks (2nd ed.)
Locality in distributed graph algorithms
SIAM Journal on Computing
Approximation algorithms for NP-hard problems
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
SIAM Journal on Computing
Nearly optimal distributed edge coloring in O(log log n) rounds
Random Structures & Algorithms
Communication complexity
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 lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed MST for constant diameter graphs
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Near-Optimal Distributed Edge Coloring
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Property testing and its connection to learning and approximation
FOCS '96 Proceedings of the 37th 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
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed approximation: a survey
ACM SIGACT News
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Local MST computation with short advice
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Theory of communication networks
Algorithms and theory of computation handbook
Learning automata-based algorithms for solving stochastic minimum spanning tree problem
Applied Soft Computing
The Journal of Supercomputing
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
A fast distributed approximation algorithm for minimum spanning trees
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |
The design of distributed approximation protocols is a relatively new rapidly developing area of research. However, so far little progress was done in the study of the hardness of distributed approximation. In this paper we initiate the systematic study of this subject, and show strong unconditional lower bounds on the time-approximation tradeoff of the distributed minimum spanning tree problem, and some of its variants.