Rachit Agarwal
ABSTRACT
We present a distance oracle that, for weighted graphs with n vertices and m edges, is of size 8n4/3m1/3log2/3n and returns stretch-2 distances in constant time. Our oracle achieves bounds identical to the constant-time stretch-2 oracle of Pǎtraşcu and Roditty, but admits significantly simpler construction and proofs.
- I. Abraham and C. Gavoille. On approximate distance labels and routing schemes with affine stretch. In International Symposium on Distributed Computing (DISC), pages 404--415, 2011. Google Scholar
Digital Library
- R. Agarwal. Distance oracles with super-constant query time, Technical report, 2013.Google Scholar
- R. Agarwal, M. Caesar, P. B. Godfrey, and B. Y. Zhao. Shortest paths in less than a millisecond. In ACM SIGCOMM Workshop on Online Social Networks (WOSN), 2012. Google ScholarDigital Library
- R. Agarwal and P. B. Godfrey. Distance oracles for stretch less than 2. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2013.Google ScholarCross Ref
- R. Agarwal, P. B. Godfrey, and S. Har-Peled. Approximate distance queries and compact routing in sparse graphs. In Proc. IEEE Conference on Computer Communications (INFOCOM), pages 1754--1762, 2011.Google ScholarCross Ref
- Pǎtraşcu and L. Roditty. Distance oracles beyond the Thorup-Zwick bound. In Proc. IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 815--823, 2010. Google ScholarDigital Library
- M. Pǎtraşcu, L. Roditty, and M. Thorup. A new infinity of distance oracles for sparse graphs. In IEEE Symposium on Foundations of Computer Science (FOCS), 2012. Google ScholarDigital Library
- C. Sommer, E. Verbin, and W. Yu. Distance oracles for sparse graphs. In Proc. IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 703--712, 2009. Google ScholarDigital Library
- M. Thorup and U. Zwick. Compact routing schemes. In Proc. ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1--10, 2001. Google ScholarDigital Library
- M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM, 52(1):1--24, January 2005. Google ScholarDigital Library
Index Terms
- Brief announcement: a simple stretch 2 distance oracle
Recommendations
Approximate distance oracles for unweighted graphs in expected O(n2) time
Let G = (V, E) be an undirected graph on n vertices, and let δ(u, v) denote the distance in G between two vertices u and v. Thorup and Zwick showed that for any positive integer t, the graph G can be preprocessed to build a data structure that can ...
Approximate distance oracles
Let G = (V,E) be an undirected weighted graph with |V| = n and |E| = m. Let k ≥ 1 be an integer. We show that G = (V,E) can be preprocessed in O(kmn1/k) expected time, constructing a data structure of size O(kn1+1/k), such that any subsequent distance ...
Approximate distance oracles with improved stretch for sparse graphs
AbstractThorup and Zwick [1] introduced the notion of approximate distance oracles, a data structure that produces for an n-vertex, m-edge weighted undirected graph G = ( V , E ), distance estimations in constant query time. They presented a ...
Highlights- Graph sparsity can help to get space-stretch tradeoffs for Distance Oracle which are strictly better than Thorup and Zwick space-stretch tradeoffs for ...
Comments