Abstract
Let G = (V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs. Zwick [15] showed that for any fixed ε> 0, stretch (1 + ε) distances between all pairs of vertices in a weighted directed graph on n vertices can be computed in \(\tilde{O}(n^{\omega})\) time assuming that edge weights in G are not too large, where ω< 2.376 is the exponent of matrix multiplication and n is the number of vertices in G. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n ×n matrices. It is also known that all-pairs stretch 3 distances can be computed in \(\tilde{O}(n^2)\) time and all-pairs stretch 7/3 distances can be computed in \(\tilde{O}(n^{7/3})\) time. Here we consider efficient algorithms for the problem of computing all-pairs stretch (2 + ε) distances in G, for any 0 < ε< 1.
We show that all pairs stretch (2 + ε) distances for any fixed ε> 0 in G can be computed in expected time O(n 9/4) assuming that edge weights in G are not too large. This algorithm uses a fast rectangular matrix multiplication subroutine. We also present a combinatorial algorithm (that is, it does not use fast matrix multiplication) with expected running time O(n 9/4) for computing all-pairs stretch 5/2 distances in G.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths(without matrix multiplication). SIAM Journal on Computing 28, 1167–1181 (1999)
Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing 28, 263–277 (1998)
Baswana, S., Goyal, V., Sen, S.: All-pairs nearly 2-approximate shortest paths in O(n 2 polylog n) time. In: 22nd Annual Symposium on Theoretical Aspect of Computer Science, pp. 666–679 (2005)
Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: 47th IEEE Symposium on Foundations of Computer Science, pp. 591–602 (2006)
Chan, T.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proceedings of 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 590–598 (2007)
Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing 28, 210–236 (1998)
Cohen, E., Zwick, U.: All-pairs small stretch paths. Journal of Algorithms 38, 335–353 (2001)
Dor, D., Halperin, S., Zwick, U.: All pairs almost shortest paths. Siam Journal on Computing 29, 1740–1759 (2000)
Elkin, M.: Computing almost shortest paths. ACM Transactions on Algorithms (TALG) 1, 282–323 (2005)
Huang, X., Pan, V.Y.: Fast rectangular matrix multiplication and applications. Journal of Complexity 14, 257–299 (1998)
K avitha, T.: Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Full version), http://drona.csa.iisc.ernet.in/~kavitha/fst07.pdf
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
Pettie, S.: A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science 312, 47–74 (2004)
Thorup, M., Zwick, U.: Approximate distance oracles. Journal of Association of Computing Machinery 52, 1–24 (2005)
Zwick, U.: All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of Association of Computing Machinery 49, 289–317 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kavitha, T. (2007). Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. In: Arvind, V., Prasad, S. (eds) FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2007. Lecture Notes in Computer Science, vol 4855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77050-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-77050-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77049-7
Online ISBN: 978-3-540-77050-3
eBook Packages: Computer ScienceComputer Science (R0)