Abstract
Thorup and Zwick [J. ACM and STOC’01] in their seminal work introduced the notion of distance oracles. Given an n-vertex weighted undirected graph with m edges, they show that for any integer k ≥ 1 it is possible to preprocess the graph in \(\tilde{O}(mn^{1/k})\) time and generate a compact data structure of size O(kn 1 + 1/k). For each pair of vertices, it is then possible to retrieve an estimated distance with multiplicative stretch 2k − 1 in O(k) time. For k = 2 this gives an oracle of O(n 1.5) size that produces in constant time estimated distances with stretch 3. Recently, Pǎtraşcu and Roditty [FOCS’10] broke the long-standing theoretical status-quo in the field of distance oracles and obtained a distance oracle for sparse unweighted graphs of O(n 5/3) size that produces in constant time estimated distances with stretch 2.
In this paper we show that it is possible to break the stretch 2 barrier at the price of non-constant query time. We present a data structure that produces estimated distances with 1 + ε stretch. The size of the data structure is O(nm 1 − ε′) and the query time is \(\tilde{O}(m^{1-\varepsilon'})\). Using it for sparse unweighted graphs we can get a data structure of size O(n 1.86) that can supply in O(n 0.86) time estimated distances with multiplicative stretch 1.75.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bartal, Y., Gottlieb, L., Kopelowitz, T., Lewenstein, M., Roditty, L.: Fast, precise and dynamic distance queries. In: Proc. of 22th SODA (to appear, 2011)
Baswana, S., Kavitha, T.: Faster algorithms for all-pairs approximate shortest paths in undirected graphs. SIAM J. Comput. 39(7), 2865–2896 (2010)
Chen, W., Sommer, C., Teng, S.-H., Wang, Y.: Compact routing in power-law graphs. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 379–391. Springer, Heidelberg (2009)
Elkin, M.: Computing almost shortest paths. ACM Transactions on Algorithms 1(2), 283–323 (2005)
Elkin, M., Peleg, D.: (1+epsilon, beta)-spanner constructions for general graphs. SIAM J. Comput. 33(3), 608–631 (2004)
Enachescu, M., Wang, M., Goel, A.: Reducing maximum stretch in compact routing. In: INFOCOM, pp. 336–340 (2008)
Krioukov, D., Fall, K.R., Yang, X.: Compact routing on internet-like graphs. In: INFOCOM (2004)
Mendel, M., Naor, A.: Ramsey partitions and proximity data structures. In: Proc. of 47th FOCS, pp. 109–118 (2006)
Pǎtraşcu, M.: (data) structures. In: Proc. of 49th FOCS, pp. 434–443 (2008)
Pǎtraşcu, M., Roditty, L.: Distance oracles beyond the thorup–zwick bound. In: Proc. of 51st FOCS (2010)
Peleg, D., Schäffer, A.A.: Graph spanners. J. Graph Theory, 99–116 (1989)
Pettie, S.: Low distortion spanners. ACM Transactions on Algorithms 6(1) (2009)
Sommer, C., Verbin, E., Yu, W.: Distance oracles for sparse graphs. In: Proc. of 50th FOCS, pp. 703–712 (2009)
Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: Proc. of 17th SODA
Thorup, M., Zwick, U.: Approximate distance oracles. JACM 52(1), 1–24 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porat, E., Roditty, L. (2011). Preprocess, Set, Query! . In: Demetrescu, C., Halldórsson, M.M. (eds) Algorithms – ESA 2011. ESA 2011. Lecture Notes in Computer Science, vol 6942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23719-5_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-23719-5_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23718-8
Online ISBN: 978-3-642-23719-5
eBook Packages: Computer ScienceComputer Science (R0)