Approximate distance oracles

Journal of the ACM

Volumn 52, Issue 1, 2005, Pages 1-24

  Thorup, Mikkel ^a,c   Zwick, Uri ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Approximate distance oracles, spanners; Distance labelings; Distance queries; Distances; Shortest paths

Indexed keywords

DISTANCE LABELINGS; QUERY TIME; SHORTEST PATHS;

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY;

COMPUTER SOFTWARE;

EID: 26444519480     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1044731.1044732     Document Type: Article

References (63)

1. AINGWORTH, D., CHEKURI, C., INDYK, P., AND MOTWANI, R. 1999. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28, 1167-1181.
2. ALON, N., HOORY, S., AND LINIAL, N. 2002. The Moore bound for irregular graphs. Graphs Combinat. 18, 1, 53-57.
3. ALON, N., AND NAOR, M. 1996. Derandomization, witnesses for Boolean matrix multiplication, and construction of perfect hash functions. Algorithmica 16, 434-449.
4. ALON, N., AND SPENCER, J. 1992. The probabilistic method. Wiley, New York.
5. ALTHÖFER, I., DAS, G., DOBKIN, D., JOSEPH, D., AND SOARES, J. 1993. On sparse spanners of weighted graphs. Disc. Computat. Geom. 9, 81-100.
6. AWERBUCH, B., BERGER, B., COWEN, L., AND PELEG, D. 1999. Near-linear time construction of sparse neighborhood covers. SIAM J. Comput. 28, 263-277.
7. AWERBUCH, B., AND PELEG, D. 1992. Routing with polynomial communication-space trade-off. SIAM J. Disc. Math. 5, 2, 151-162.
8. BARTAL, Y. 1999. On approximating arbitrary metrices by tree metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (Dallas, Tex.), ACM, New York, 161-168.
9. 1+1/k) size in weighted graphs. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands. 384-396.
10. 2 log n) time. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans La.). ACM, New York, 264-273.
11. BENSON, C. 1966. Minimal regular graphs of girth eight and twelve. Canad. J. Math. 18, 1091-1094.
12. BOLLOBÁS, B. 1978. Extremal graph theory. Academic Press, Orlando, Fla.
13. BONDY, J., AND SIMONOVITS, M. 1974. Cycles of even length in graphs. J. Combinat. Theory, Ser. B 16, 97-105.
14. BOURGAIN, J. 1985. On Libschitz embedding of finite metric spaces in hilbert space. Isr. J. Math. 52, 46-52.
15. BROWN, W. 1966. On graphs that do not contain a Thomsen graph. Canad. Math. Bull. 9, 281-285.
16. CARTER, J. L., AND WEGMAN, M. N. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 143-154.
17. CHAUDHURI, S., AND ZAROLIAGIS, C. 2000. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica 27, 212-226.
18. COHEN, E. 1999. Fast algorithms for constructing t -spanners and paths with stretch t. SIAM J. Comput. 28, 210-236.
19. COHEN, E., AND ZWICK, U. 2001. All-pairs small-stretch paths. J. Algor. 38, 335-353.
20. CORMEN, T., LEISERSON, C., RIVEST, R., AND STEIN, C. 2001. Introduction to Algorithms, 2nd ed. The MIT Press, Cambridge, Mass.
21. DIETZFELBINGER, M., HAGERUP, T., KATAJAINEN, J., AND PENTTONEN, M. 1997. A reliable randomized algorithm for the closest-pair problem. J. Algorithms 25, 19-51.
22. DIETZFELBINGER, M., AND HÜNE, M. 1996. A dictionary implementaion based on dynamic perfect hashing. DIMACS Implementation Challenge, unpublished paper.
23. DIJKSTRA, E. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1, 269-271.
24. DOR, D., HALPERIN, S., AND ZWICK, U. 2000. All pairs almost shortest paths. SIAM J. Comput. 29, 1740-1759.
25. ELKIN, M. 2001. Computing almost shortest paths. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (Newport, R. I). ACM, New York, 53-62.
26. ELKIN, M., AND PELEG, D. 2004. (1 + ε, β)-Spanner constructions for general graphs. SIAM J. Comput. 33, 3, 608-631.
27. ERDOS, P. 1964. Extremal problems in graph theory. In Theory of Graphs and ITs Applications (Proc. Sympos. Smolenice, 1963). Publ. House Czechoslovak Acad. Sci., Prague, 29-36.
28. ERDOS, P., RÉNYI, A., AND SÓS, V. 1966. On a problem of graph theory. Studia Sci. Math. Hungar. 1, 215-235.
29. FAKCHAROENPHOL, J., RAO, S., AND TALWAR, K. 2003. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (San Diego, Calif.). ACM, New York, 448-455.
30. FREDMAN, M., KOMLÓS, J., AND SZEMERÉDI, E. 1984. Storing a sparse table with O (1) worst case access time. J. ACM 31, 538-544.
31. FREDMAN, M., AND TARJAN, R. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596-615.
32. GAVOILLE, C., PELEG, D., PÉRENNES, S., AND RAZ, R. 2001. Distance labeling in graphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms(Washington, D.C.). ACM, New York, 210-219.
33. GUDMUNDSON, J., LEVCOPOULOS, C., NARASIMHAN, G., AND SMID, M. 2002. Approximate distance oracles revisited. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation. 357-368.
34. INDYK, P. 1999. Sublinear time algorithms for metric space problems. In Proceedings of the 31th Annual ACM Symposium on Theory of Computing (Atlanta, Ga). ACM, New York, 428-434.
35. KARGER, D., KOLLER, D., AND PHILLIPS, S. 1993. Finding the hidden path: Time bounds for all-pairs shortest paths. SIAM J. Comput. 22, 1199-1217.
36. KLEIN, P. 2002. Preprocessing an undirected planar network to enable fast approximate distance queries. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif.). ACM, New York, 820-827.
37. KRUSKAL, J. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. AMS 7, 48-50.
38. LAZEBNIK, F., AND USTIMENKO, V. 1993. New examples of graphs without small cycles and of large size. Europ. J. Combinat. 14, 5, 445-460.
39. LAZEBNIK, F., USTIMENKO, V., AND WOLDAR, A. 1995. A new series of dense graphs of high girth. Bull. AMS (New Series) 32, 1, 73-79.
40. LAZEBNIK, F., USTIMENKO, V., AND WOLDAR, A. 1996. A characterization of the components of the graphs D(k, q). Disc. Math. 157, 1-3, 271-283.
41. LINIAL, N., LONDON, E., AND RABINOVICH, Y. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 215-245.
42. LUBOTZKY, A., PHILLIPS, R., AND SARNAK, P. 1988. Ramanujan graphs. Combinatorica 8, 261-277.
43. MARGULIS, G. 1988. Explicit group-theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators. Probl. Inf. Transmis. 24, 39-46.
44. MATOUŠEK, J. 1996. On the distortion required for embedding finite metric spaces into normed spaces. Isr. J. Math. 93, 333-344.
45. MATOUŠEK, J. 2002. Lectures on discrete geometry. In Graduate Texts in Mathematics, vol. 212. Springer-Verlag, New York.
46. MCGEOCH, C. 1995. All-pairs shortest paths and the essential subgraph. Algorithmica 13, 426-461.
47. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, Mass,
48. PELEG, D. 2000a. Distributed computing - A locality-sensitive approach. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pa.
49. PELEG, D. 2000b. Proximity-preserving labeling schemes. J. Graph Theory 33, 167-176.
50. PELEG, D., AND SCHÄFFER, A. 1989. Graph spanners. J. Graph Theory 13, 99-116.
51. REIMAN, I. 1958. Über ein Problem von K. Zarankiewicz. Acta. Math. Acad. Sci. Hungar. 9, 269-273.
52. SHOSHAN, A., AND ZWICK, U. 1999. All pairs shortest paths in undirected graphs with integer weights. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (New York, N.Y.). IEEE Computer Society Press, Los Alamitos, Calif., 605-614.
53. THORUP, M. 1999. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46, 362-394.
54. THORUP, M. 2000a. Even strongly universal hashing is pretty fast. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif.). ACM, New York, 496-497.
55. THORUP, M. 2000b. Floats, integers, and single source shortest paths. J. Algorithms 35, 189-201.
56. THORUP, M. 2001. Compact oracles for reachability and approximate distances in planar digraphs. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (Las Vegas, Nev). IEEE Computer Society Press, Los Alamitos, Calif., 242-251.
57. THORUP, M., AND ZWICK, U. 2001. Compact routing schemes. In Porceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (Crete, Greece). ACM, New York, 1-10.
58. TITS, J. 1959. Sur la trialite et certains groupes qui s'en déduisent. Publ. Math. I.H.E.S. 2, 14-20.
59. VITTER, J. 2001. External memory algorithms and data structures: Dealing with MASSIVE DATA. ACM Comput. Surv. 33, 2, 209-271.
60. 10's. J. Combinat. Theory, Ser. B 52, 113-116.
61. WILLIAMS, J. 1964. Heapsort. Commun ACM 7, 5, 347-348.
62. WOLDAR, A., AND USTIMENKO, V. 1993. An application of group theory to extremal graph theory. In Group theory, Proceedings of the Ohio State-Denison Conference. World Sci. Publishing, River Edge, N.J. 293-298.
63. ZWICK, U. 2002. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49, 289-317.