Approximate distance oracles revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 357-368

  Gudmundsson, Joachim ^a   Levcopoulos, Christos ^b   Narasimhan, Giri ^c   Smid, Michiel ^d  

^a UTRECHT UNIVERSITY   (Netherlands)

^b LUND UNIVERSITY   (Sweden)

^c The Department of Electrical and Computer Engineering   (United States)

^d CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SHORTEST-PATH; GEOMETRIC T-SPANNERS; SHORTEST PATH QUERIES;

DATA STRUCTURES; COMPUTERS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

EID: 84878636580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_32     Document Type: Conference Paper

References (14)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28:1167-1181, 1999.
2. S. Alstrup and J. Holm, Improved algorithms for finding level ancestors in dynamic trees. In Proc. 27th International Colloquium on Automata, Languages, and Programming, 2000.
3. S. Arikati, D. Z. Chen, L. P. Chew, G. Das, M. Smid, and C. D. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proc. 4th European Symposium on Algorithms, LNCS 1136, pp. 514-528, 1996. (Pubitemid 126128886)
4. D. Z. Chen. On the all-pairs Euclidean short path problem. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 292-301, 1995.
5. D. Z. Chen, K. S. Klenk, and H.-Y. T. Tu. Shortest path queries among weighted obstacles in the rectilinear plane. SIAM Journal on Computing, 29:1223-1246, 2000.
6. Y.-J. Chiang and J. S. B. Mitchell. Two-point Euclidean shortest path queries in the plane. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
7. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing, 28:210-236, 1998. (Pubitemid 128491797)
8. D. Dor, S. Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM Journal on Computing, 29:1740-1759, 2000. (Pubitemid 32021664)
9. J. Gudmundsson, C. Levcopoulos, G. Narasimhan and M. Smid. Approximate Distance Oracles for Geometric graphs. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.
10. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13:338-355, 1984. (Pubitemid 15493878)
11. J. B. Kruskal, Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7(1956):48-50, 1956.
12. D. Krznaric, C. Levcopoulos and B. J. Nilsson. Minimum Spanning Trees in d Dimensions. Nordic Journal of Computing, 6(4):446-461, 1999.
13. J. S. B. Mitchell. Shortest paths and networks. In Handbook of Discrete and Computational Geometry, pp. 445-466. CRC Press LLC, 1997.
14. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. 33rd ACM Symposium on Theory of Computing, 2001.