Brief announcement: a simple stretch 2 distance oracle

We present a distance oracle that, for weighted graphs with <i>n</i> vertices and <i>m</i> edges, is of size 8<i>n</i><sup>4/3</sup><i>m</i><sup>1/3</sup>log<sup>2/3</sup><i>n</i> 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.

[1]  Mikkel Thorup,et al.  Compact routing schemes , 2001, SPAA '01.

[2]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[3]  Mikkel Thorup,et al.  A New Infinity of Distance Oracles for Sparse Graphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[4]  Brighten Godfrey,et al.  Approximate distance queries and compact routing in sparse graphs , 2011, 2011 Proceedings IEEE INFOCOM.

[5]  Brighten Godfrey,et al.  Distance Oracles for Stretch Less Than 2 , 2013, SODA.

[6]  Wei Yu,et al.  Distance Oracles for Sparse Graphs , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Mihai Patrascu,et al.  Distance Oracles beyond the Thorup-Zwick Bound , 2014, SIAM J. Comput..

[8]  Ittai Abraham,et al.  On Approximate Distance Labels and Routing Schemes with Affine Stretch , 2011, DISC.

[9]  Ben Y. Zhao,et al.  Shortest paths in less than a millisecond , 2012, WOSN '12.