Let <i>G</i>(<i>V, E</i>) be an undirected weighted graph with |<i>V</i>| = <i>n</i>, |<i>E</i>| = <i>m</i>. Recently Thorup and Zwick introduced a remarkable data-structure that stores all pairs approximate distance information implicitly in <i>o</i>(<i>n</i><sup>2</sup>) space, and yet answers any approximate distance query in <i>constant</i> time. They named this data-structure <i>approximate distance oracle</i> because of this feature. Given an integer <i>k</i> < 1, a (2k-1)-approximate distance oracle requires <i>O</i>(<i>kn</i><sup>1+1/<i>k</i></sup>) space and answers a (2<i>k</i>-1)-approximate distance query in <i>O</i>(<i>k</i>) time. Thorup and Zwick showed that a (2<i>k</i> - 1)-approximate distance oracle can be computed in <i>O</i>(<i>kmn</i><sup>1/<i>k</i></sup>) time, and posed the following question : <i>Can</i> (2k - 1)-<i>approximate distance oracle be computed in</i> Õ(<i>n</i><sup>2</sup>) <i>time</i>?In this paper, we answer their question in affirmative for unweighted graphs. We present an algorithm that computes (2<i>k</i> -1)-approximate distance oracle for a given unweighted graph in Õ(<i>n</i><sup>2</sup>) time. One of the new ideas used in the improved algorithm also leads to the first linear time algorithm for computing an optimal size (2, 1)-spanner of an unweighted graph.
[1]
Mikkel Thorup,et al.
Approximate distance oracles
,
2001,
JACM.
[2]
Vijay V. Vazirani,et al.
Approximation Algorithms
,
2001,
Springer Berlin Heidelberg.
[3]
Sandeep Sen,et al.
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs
,
2003,
ICALP.
[4]
Don Coppersmith,et al.
Matrix multiplication via arithmetic progressions
,
1987,
STOC.
[5]
Edith Cohen,et al.
All-pairs small-stretch paths
,
1997,
SODA '97.
[6]
Uri Zwick,et al.
All-Pairs Almost Shortest Paths
,
1997,
SIAM J. Comput..
[7]
Michael Elkin,et al.
Computing almost shortest paths
,
2001,
TALG.
[8]
Uri Zwick,et al.
All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms
,
1998,
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).