Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
Citations
123 citations
Cites background from "Faster Algorithms for Approximate D..."
...…India; e-mail: sbaswana@cse.iitk.ac.in; T. Kavitha, Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India; e-mail: kavitha@cse.iisc.ernet.in; K. Mehlhorn, Max-Planck-Institut f¨ur Informatik, Stuhlsatzenhausweg 61, 66123 Saarbr¨ucken, Germany;…...
[...]
...…application of spanners is the construction of labeling schemes and distance oracles [Thorup and Zwick 2005; Baswana and Sen 2006; Roditty et al. 2005; Baswana and Kavitha 2006; Baswana et al. 2008], which are data structures that can report approximately accurate distances in constant time....
[...]
117 citations
Cites background from "Faster Algorithms for Approximate D..."
...A recent application of spanners is in the design of approximate distance oracles and labeling schemes for arbitrary metrics; see [23, 4] for further references....
[...]
...A recent application of spanners is in the design of approximate distance oracles and labeling schemes [Thorup and Zwick 2005; Baswana and Sen 2007; Roditty et al. 2005; Baswana and Kavitha 2006] for arbitrary metrics....
[...]
110 citations
103 citations
101 citations
References
1,413 citations
"Faster Algorithms for Approximate D..." refers methods in this paper
...The fastest known algorithm for matrix multiplication due to Coppersmith and Winograd [9] implies ω < 2....
[...]
943 citations
618 citations
563 citations
"Faster Algorithms for Approximate D..." refers background or methods in this paper
...This algorithm is based on the following important property of A(S, k) (proved in Theorem 3.1 below) : For any two vertices u, v ∈ S, the scheme A(S, k) stores a (2, ω)-approximate distance between them....
[...]
...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(n2 log n) time....
[...]
...However, the complexity of the fastest known algorithm for the APSP problem in a graph with m edges and n vertices with real non-negative edge weights is O(mn + n2 log log n) [14]....
[...]
560 citations