Bounded-leg distance and reachability oracles
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time
Theoretical Computer Science
Approximating Shortest Paths in Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Efficient approximation algorithms for shortest cycles in undirected graphs
Information Processing Letters
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
ACM Transactions on Algorithms (TALG)
Minimum cycle bases: Faster and simpler
ACM Transactions on Algorithms (TALG)
Faster algorithms for all-pairs small stretch distances in weighted graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Efficient approximation algorithms for shortest cycles in undirected graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
SIAM Journal on Computing
Fault Tolerant Spanners for General Graphs
SIAM Journal on Computing
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms (TALG)
Distance oracles for vertex-labeled graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Subquadratic time approximation algorithms for the girth
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast, precise and dynamic distance queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Node-Disjoint multipath spanners and their relationship with fault-tolerant spanners
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Distributed algorithms for network diameter and girth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Improved distance oracles and spanners for vertex-labeled graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fault tolerant additive spanners
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Multipath spanners via fault-tolerant spanners
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
ACM Transactions on Algorithms (TALG)
Efficient distributed source detection with limited bandwidth
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Let G = (V,E) be a weighted undirected graph with |V | = n and |E| = m. An estimate \hat \delta \left( {u,v} \right) of the distance\delta \left( {u,v} \right) in G between u, v \in V is said to be of stretch t iff \delta \left( {u,v} \right) \leqslant \hat \delta \left( {u,v} \right) \leqslant t · \delta \left( {u,v} \right). The most efficient algorithms known for computing small stretch distances in G are the approximate distance oracles of [16] and the three algorithms in [9] to compute all-pairs stretch t distances for t = 2, 7/3, and 3. We present faster algorithms for these problems. For any integer k \geqslant 1, Thorup and Zwick in [16] gave an O(kmn^{1/k}) algorithm to construct a data structure of size O(kn^{1+1/k}) which, given a query (u, v) \in V 脳 V , returns in O(k) time, a 2k - 1 stretch estimate of \delta \left( {u,v} \right). But for small values of k, the time to construct the oracle is rather high. Here we present an O(n^2 log n) algorithm to construct such a data structure of size O(kn^{1+1/k}) for all integers k \geqslant 2. Our query answering time is O(k) for k \ge 2 and \Theta (log n) for k = 2. We use a new generic scheme for all-pairs approximate shortest paths for these results. This scheme also enables us to design faster algorithms for allpairs t-stretch distances for t = 2 and 7/3, and compute all-pairs almost stretch 2 distances in O(n^2 log n) time.