ABSTRACT
Let G=(V,E) be an undirected weighted graph with |V|=n and |E|=m. Let k\ge 1 be an integer. We show that G=(V,E) can be preprocessed in O(kmn^{1/k}) expected time, constructing a data structure of size O(kn^{1+1/k}), such that any subsequent distance query can be answered, approximately, in O(k) time. The approximate distance returned is of stretch at most 2k-1, i.e., the quotient obtained by dividing the estimated distance by the actual distance lies between 1 and 2k-1. We show that a 1963 girth conjecture of Erd{\H{o}}s, implies that ω(n^{1+1/k}) space is needed in the worst case for any real stretch strictly smaller than 2k+1. The space requirement of our algorithm is, therefore, essentially optimal. The most impressive feature of our data structure is its constant query time, hence the name oracle. Previously, data structures that used only O(n^{1+1/k}) space had a query time of ω(n^{1/k}) and a slightly larger, non-optimal, stretch. Our algorithms are extremely simple and easy to implement efficiently. They also provide faster constructions of sparse spanners of weighted graphs, and improved tree covers and distance labelings of weighted or unweighted graphs.}
- 1.D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Computing, 28:1167-1181, 1999.]] Google Scholar
- 2.N. Alon, S. Hoory, and N. Linial. The Moore bound for irregular graphs. Submitted for publication, 2000.]]Google Scholar
- 3.N. Alon and M. Naor. Derandomization, witnesses for boolean matrix multiplication, and construction of perfect hash functions. Algorithmica, 16:434-449, 1996.]]Google Scholar
- 4.N. Alon and J. Spencer. The probabilistic method. Wiley, 1992.]]Google Scholar
- 5.I. Althofer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993.]]Google ScholarDigital Library
- 6.S. Arikati, D. Chen, L. Chew, G. Das, M. Smid, and C. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proc. 4th ESA, pages 514-528, 1996.]] Google Scholar
- 7.B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM J. Computing, 28:263-277, 1999.]] Google Scholar
- 8.B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM J. Discrete Mathematics, 5(2):151-162, 1992.]] Google Scholar
- 9.Y. Bartal. On approximating arbitrary metrices by tree metrics. In Proc. 30th STOC, pages 161-168, 1999.]] Google Scholar
- 10.C. Benson. Minimal regular graphs of girth eight and twelve. Canadian Journal of Mathematics, 18:1091-1094, 1966.]]Google Scholar
- 11.B. Bollobas. Extremal graph theory. Academic Press, 1978.]] Google Scholar
- 12.J. Bondy and M. Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16:97-105, 1974.]]Google ScholarDigital Library
- 13.J. Bourgain. On libschitz embedding of finite metric spaces in hilbert space. Israel J. Math., 52:46-52, 1985.]]Google Scholar
- 14.W. Brown. On graphs that do not contain a Thomsen graph. Canad. Math. Bull., 9:281-285, 1966.]]Google ScholarDigital Library
- 15.J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sc., 18:143-154, 1979.]]Google Scholar
- 16.S. Chaudhuri and C. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27:212-226, 2000.]]Google Scholar
- 17.Y. Chiang and J. Mitchell. Two-point Euclidean shortest path queries in the plane. In Proc. 10th SODA, pages 215-224, 1999.]] Google Scholar
- 18.E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Computing, 28:210-236, 1999.]] Google Scholar
- 19.E. Cohen and U. Zwick. All-pairs small-stretch paths. J. Algorithms, 38:335-353, 2001.]] Google Scholar
- 20.T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. The MIT Press, 1990.]] Google Scholar
- 21.M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. J. Algorithms, 25:19-51, 1997.]] Google Scholar
- 22.M. Dietzfelbinger and M. Hune. A dictionary implementaion based on dynamic perfect hashing, 1996. DIMACS 1996 Implementation Challenge. To appear in AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science.]]Google Scholar
- 23.E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.]]Google Scholar
- 24.H. Djidjev. Efficient algorithms for shortest path queries in planar digraphs. In Proc. 22nd WG, pages 151-165, 1996.]] Google Scholar
- 25.D. Dor, S. Halperin, and U. Zwick. All pairs almost shortest paths. SIAM J. Computing, 29:1740-1759, 2000.]] Google Scholar
- 26.M. Elkin. Computing almost shortest paths. Technical Report MCS01-03, Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 2001.]] Google Scholar
- 27.M. Elkin and D. Peleg. (1 + e,b)-Spanner constructions for general graphs. In Proc. 33th STOC, 2001. To appear.]] Google Scholar
- 28.P. Erd os. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pages 29-36. Publ. House Czechoslovak Acad. Sci., Prague, 1964.]]Google Scholar
- 29.P. Erdos, A. Renyi, and V. Sos. On a problem of graph theory. Studia Sci. Math. Hungar., 1:215-235, 1966.]]Google Scholar
- 30.M. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with O(1) worst case access time. J. ACM, 31:538-544, 1984.]] Google Scholar
- 31.M. Fredman and R. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34:596-615, 1987.]] Google Scholar
- 32.C. Gavoille, D. Peleg, S. Perennes, and R. Raz. Distance labeling in graphs. In Proc. 12th SODA, pages 210-219, 2001.]] Google Scholar
- 33.S. Halperin and U. Zwick. Unpublished result, 1996.]]Google Scholar
- 34.P. Indyk. Sublinear time algorithms for metric space problems. In Proc. 31th STOC, pages 428-434, 1999.]] Google Scholar
- 35.D. Karger, D. Koller, and S. Phillips. Finding the hidden path: time bounds for all-pairs shortest paths. SIAM J. Computing, 22:1199-1217, 1993.]] Google Scholar
- 36.J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48-50, 1956.]]Google ScholarDigital Library
- 37.F. Lazebnik and V. Ustimenko. New examples of graphs without small cycles and of large size. European Journal of Combinatorics, 14(5):445-460, 1993. Algebraic combinatorics (Vladimir, 1991).]] Google Scholar
- 38.F. Lazebnik, V. Ustimenko, and A. Woldar. A new series of dense graphs of high girth. Bulletin of the American Mathematical Society (New Series), 32(1):73-79, 1995.]]Google Scholar
- 39.F. Lazebnik, V. Ustimenko, and A. Woldar. A characterization of the components of the graphs D(k; q). Discrete Mathematics, 157(1-3):271-283, 1996.]] Google Scholar
- 40.N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.]]Google Scholar
- 41.A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261-277, 1988.]]Google ScholarDigital Library
- 42.G. Margulis. Explicit group-theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators. Problems of Information Transmission, 24:39-46, 1988.]]Google Scholar
- 43.C. McGeoch. All-pairs shortest paths and the essential subgraph. Algorithmica, 13:426-461, 1995.]]Google ScholarDigital Library
- 44.D. Peleg. Distributed computing - A locality-sensitive approach. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2000.]] Google Scholar
- 45.D. Peleg. Proximity-preserving labeling schemes. J. Graph Theory, 33:167-176, 2000.]]Google ScholarDigital Library
- 46.D. Peleg and A. Schaffer. Graph spanners. J. Graph Theory, 13:99-116, 1989.]]Google ScholarDigital Library
- 47.I. Reiman. Uber ein Problem von K. Zarankiewicz. Acta. Math. Acad. Sci. Hungar., 9:269-273, 1958.]]Google Scholar
- 48.A. Shoshan and U. Zwick. All pairs shortest paths in undirected graphs with integer weights. In Proc. 40th FOCS, pages 605-614, 1999.]] Google Scholar
- 49.M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM, 46:362-394, 1999.]] Google Scholar
- 50.M. Thorup. Even strongly universal hashing is pretty fast. In Proc. 11th SODA, pages 496-497, 2000.]] Google Scholar
- 51.M. Thorup. Floats, integers, and single source shortest paths. J. Algorithms, 35:189-201, 2000.]] Google Scholar
- 52.M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs, 2001. Submitted.]]Google Scholar
- 53.M. Thorup. Quick k-median, k-center, and facility location for sparse graphs. In Proc. 28th ICALP, 2001. To appear.]] Google Scholar
- 54.M. Thorup and U. Zwick. Compact routing schemes. In Proc. 13th SPAA, 2001. To appear.]] Google Scholar
- 55.J. Tits. Sur la trialite et certains groupes qui s'en d eduisent. Publ. Math. I.H.E.S., 2:14-20, 1959.]]Google Scholar
- 56.R. Wenger. Extremal graphs with no C 4 's, C 6 's and C 10 's. Journal of Combinatorial Theory, Series B, 52:113-116, 1991.]] Google Scholar
- 57.J. Williams. Heapsort. Comm. ACM, 7(5):347-348, 1964.]]Google Scholar
- 58.A. Woldar and V. Ustimenko. An application of group theory to extremal graph theory. In Group theory, Proceedings of the Ohio State-Denison Conference, pages 293-298. World Sci. Publishing, River Edge, NJ, 1993.]]Google Scholar
- 59.U. Zwick. All pairs shortest paths in weighted directed graphs - exact and almost exact algorithms. In Proc. 39th FOCS, pages 310-319, 1998.]] Google Scholar
Index Terms
- Approximate distance oracles
Recommendations
Approximate distance oracles
Let G = (V,E) be an undirected weighted graph with |V| = n and |E| = m. Let k ≥ 1 be an integer. We show that G = (V,E) can be preprocessed in O(kmn1/k) expected time, constructing a data structure of size O(kn1+1/k), such that any subsequent distance ...
Approximate distance oracles subject to multiple vertex failures
SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete AlgorithmsGiven an undirected graph G = (V, E) of n vertices and m edges with weights in [1, W], we construct vertex sensitive distance oracles (VSDO), which are data structures that preprocess the graph, and answer the following kind of queries: Given a source ...
Approximate distance oracles with improved query time
SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithmsGiven an undirected graph G with m edges, n vertices, and non-negative edge weights, and given an integer k ≥ 2, we show that a (2k − 1)-approximate distance oracle for G of size O(kn1+1/k) and with O(log k) query time can be constructed in O(min{kmn1/k,...
Comments