Complexity of network synchronization
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
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing in directed networks
Journal of Algorithms
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
SIAM Journal on Computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of 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
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
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
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sparse Distance Preservers and Additive Spanners
SIAM Journal on Discrete Mathematics
Sparse Sourcewise and Pairwise Distance Preservers
SIAM Journal on Discrete Mathematics
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
Geometric Spanner Networks
ACM Transactions on Algorithms (TALG)
Distributed algorithms for ultrasparse spanners and linear size skeletons
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Local computation of nearly additive spanners
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Additive spanners in nearly quadratic time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Computing graph spanners in small memory: fault-tolerance and streaming
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Fault Tolerant Spanners for General Graphs
SIAM Journal on Computing
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
On approximate distance labels and routing schemes with affine stretch
DISC'11 Proceedings of the 25th international conference on 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
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Multipath spanners via fault-tolerant spanners
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
| Hi-index | 0.00 |
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G is an f-spanner of G if any two vertices u, v at distance d in G are at distance at most f(d) in H. There is clearly some tradeoff between the sparsity of H and the distortion function f, though the nature of this tradeoff is still poorly understood. In this paper we present a simple, modular framework for constructing sparse spanners that is based on interchangable components called connection schemes. By assembling connection schemes in different ways we can recreate the additive 2- and 6-spanners of Aingworth et al. and Baswana et al. and improve on the (1+ε, β)-spanners of Elkin and Peleg, the sublinear additive spanners of Thorup and Zwick, and the (non constant) additive spanners of Baswana et al. Our constructions rival the simplicity of all comparable algorithms and provide substantially better spanners, in some cases reducing the density doubly exponentially