Approximate distance oracles

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 183-192

  Thorup, M ^a   Zwick, U ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES;

WEIGHTED GRAPHS;

GRAPH THEORY;

EID: 0034832434     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380798     Document Type: Conference Paper

References (59)

1. Fast estimation of diameter and shortest paths (without matrix multiplication)
2. Derandomization, witnesses for boolean matrix multiplication, and construction of perfect hash functions
3. On sparse spanners of weighted graphs
4. Planar spanners and approximate shortest path queries among obstacles in the plane
5. Near-linear time construction of sparse neighborhood covers
6. Routing with polynomial communication-space trade-off
7. On approximating arbitrary metrices by tree metrics
8. Minimal regular graphs of girth eight and twelve
9. Cycles of even length in graphs
10. On libschitz embedding of finite metric spaces in hilbert space
11. On graphs that do not contain a Thomsen graph
12. Universal classes of hash functions
13. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms
14. Two-point Euclidean shortest path queries in the plane
15. Fast algorithms for constructing t-spanners and paths with stretch t
16. All-pairs small-stretch paths
17. A reliable randomized algorithm for the closest-pair problem
18. A dictionary implementation based on dynamic perfect hashing
19. A note on two problems in connexion with graphs
20. Efficient algorithms for shortest path queries in planar digraphs
21. All pairs almost shortest paths
22. (1 + ε,β)-spanner constructions for general graphs
23. Extremal problems in graph theory
24. On a problem of graph theory
25. Storing a sparse table with O(1) worst case access time
26. Fibonacci heaps and their uses in improved network optimization algorithms
27. Distance labeling in graphs
28. Sublinear time algorithms for metric space problems
29. Finding the hidden path: Time bounds for all-pairs shortest paths
30. On the shortest spanning subtree of a graph and the traveling salesman problem
31. New examples of graphs without small cycles and of large size
32. A new series of dense graphs of high girth
33. A characterization of the components of the graphs D (k, q)
34. The geometry of graphs and some of its algorithmic applications
35. Ramanujan graphs
36. Explicit group-theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators
37. All-pairs shortest paths and the essential subgraph
38. Proximity-preserving labeling schemes
39. Graph spanners
40. Über ein Problem von K. Zarankiewicz
41. All pairs shortest paths in undirected graphs with integer weights
42. Undirected single-source shortest paths with positive integer weights in linear time
43. Even strongly universal hashing is pretty fast
44. Floats, integers, and single source shortest paths
45. Quick k-median, k-center, and facility location for sparse graphs
46. Compact routing schemes
47. Sur la trialité et certains groupes qni s'en déduisent
48. 10's
49. An application of group theory to extremal graph theory
50. All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms