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
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Journal of the ACM (JACM)
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
Compact routing with minimum stretch
Journal of Algorithms
Journal of Algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing in directed networks
Journal of Algorithms
Approximate distance oracles for unweighted graphs in Õ (n2) time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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 simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Sparse source-wise and pair-wise distance preservers
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
Approximate distance oracles for unweighted graphs in expected O(n2) time
ACM Transactions on Algorithms (TALG)
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Spanners for bounded tree-length graphs
Theoretical Computer Science
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
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
Approximating Shortest Paths in Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Small stretch (α,β)-spanners in the streaming model
Theoretical Computer Science
Small stretch spanners in the streaming model: new algorithms and experiments
ESA'07 Proceedings of the 15th annual European conference on Algorithms
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
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ACM Transactions on Algorithms (TALG)
Approximate distance oracles with improved preprocessing 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
Exact distance labelings yield additive-stretch compact routing schemes
DISC'06 Proceedings of the 20th international conference on Distributed Computing
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
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
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
HDLBR: A name-independent compact routing scheme for power-law networks
Computer Communications
Hi-index | 0.00 |
An (α, β)-spanner of an unweighted graph G is a subgraph H that approximates distances in G in the following sense. For any two vertices u, v: δH (u, v) ≤ αδG(u, v) + β, where δG is the distance w.r.t. G. It is well known that there exist (multiplicative) (2k - 1, 0)-spanners of size O(n1+1/k) and that there exist (purely additive) (1, 2)-spanners of size O(n3/2). However no other (1, O(1))-spanners are known to exist.In this paper we develop a couple new techniques for constructing (α, β)-spanners. The first result is a purely additive (1, 6)-spanner of size O(n4/3). Our construction algorithm can be understood as an economical agent that assigns costs and values to paths in the graph, purchasing affordable paths and ignoring expensive ones, which are intuitively well-approximated by paths already purchased. This general approach should lead to new spanner constructions.The second result is a truly simple linear time construction of (k, k - 1)-spanners with size O(n1+1/k). In a distributed network the algorithm terminates in a constant number of rounds and has expected size O(n1+1/k). The new idea here is primarily in the analysis of the construction. We show that a few simple and local rules for picking spanner edges induce seemingly coordinated global behavior.