Brief announcement: a simple stretch 2 distance oracle

Authors:
Rachit Agarwal;Philip Brighten Godfrey
Affiliations:
University of Illinois at Urbana-Champaign, Urbana, IL, USA;University of Illinois at Urbana-Champaign, Urbana, IL, USA
Venue:
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Year:
2013

Citing 7
Cited 0

Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Approximate distance oracles

Journal of the ACM (JACM)
Distance Oracles for Sparse Graphs

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Distance Oracles beyond the Thorup-Zwick Bound

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
On approximate distance labels and routing schemes with affine stretch

DISC'11 Proceedings of the 25th international conference on Distributed computing
Shortest paths in less than a millisecond

Proceedings of the 2012 ACM workshop on Workshop on online social networks
A New Infinity of Distance Oracles for Sparse Graphs

FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.