Complexity of network synchronization
Journal of the ACM (JACM)
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Extremal graphs with no C4,s, or C10,s
Journal of Combinatorial Theory Series B
Locality in distributed graph algorithms
SIAM Journal on Computing
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Spanners and message distribution in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
SIAM Journal on Computing
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Sparse source-wise and pair-wise distance preservers
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
New constructions of (α, β)-spanners and purely additive spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
On space-stretch trade-offs: lower bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Lower Bounds for Additive Spanners, Emulators, and More
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Distributed algorithms for ultrasparse spanners and linear size skeletons
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local computation of nearly additive spanners
DISC'09 Proceedings of the 23rd international conference on Distributed computing
What can be observed locally? round-based models for quantum distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Node-Disjoint multipath spanners and their relationship with fault-tolerant spanners
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fully dynamic randomized algorithms for graph spanners
ACM Transactions on Algorithms (TALG)
Hi-index | 0.01 |
The paper presents a deterministic distributed algorithm that, given k ≥ 1, constructs in k rounds a (2k-1,0)-spanner of O(k n1+1/k) edges for every n-node unweighted graph. (If n is not available to the nodes, then our algorithm executes in 3k-2 rounds, and still returns a (2k-1,0)-spanner with O(k n1+1/k) edges.) Previous distributed solutions achieving such optimal stretch-size trade-off either make use of randomization providing performance guarantees in expectation only, or perform in logΩ(1)n rounds, and all require a priori knowledge of n. Based on this algorithm, we propose a second deterministic distributed algorithm that, for every ε 0, constructs a (1+ε,2)-spanner of O(ε-1 n3/2) edges in O(ε-1) rounds, without any prior knowledge on the graph. Our algorithms are complemented with lower bounds, which hold even under the assumption that n is known to the nodes. It is shown that any (randomized) distributed algorithm requires k rounds in expectation to compute a (2k-1,0)-spanner of o(n1+1/(k-1)) edges for k ∈ {2,3,5}. It is also shown that for every k1, any (randomized) distributed algorithm that constructs a spanner with fewer than n1+1/k + ε edges in at most nε expected rounds must stretch some distances by an additive factor of nΩ(ε). In other words, while additive stretched spanners with O(n1+1/k) edges may exist, e.g., for k=2,3, they cannot be computed distributively in a sub-polynomial number of rounds in expectation.