Approximate distance oracles for geometric graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 828-837

  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

QUERY PROCESSING;

APPROXIMATION SCHEME; EDGE LENGTH; GEOMETRIC GRAPHS; GEOMETRIC T-SPANNERS; GRAPH G; SHORTEST PATH QUERIES;

GRAPH THEORY;

EID: 84968754795     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Mot-wani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28:1167-1181, 1999.
2. 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 4th ESA, LNCS, Vol. 1136, pp. 514-528, 1996.
3. S. Arya, D. M. Mount, and M. Smid. Randomized and deterministic algorithms for geometric spanners of small diameter. In 35th FOCS, 703-712, 1994.
4. S. Arya and M. Smid. Efficient construction of a bounded-degree spanner with low weight. Algorithmica, 17:33-54, 1997.
5. M. A. Bender and M. Farach-Colton. The LCA problem revisited. In 4th LATIN, LNCS, Vol. 1776, pp. 88-94, 2000.
6. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to/c-nearest-neighbors and n-body potential fields. Journal of the ACM, 42:67-90, 1995.
7. D. Z. Chen. On the all-pairs Euclidean short path problem. In 6th SODA, pp. 292-301, 1995.
8. 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.
9. Y.-J. Chiang and J. S. B. Mitchell. Two-point euclidean shortest path queries in the plane. In 10th SODA, 1999.
10. K. L. Clarkson. Approximation algorithms for shortest path motion planning. In 19th STOC, pp. 56-65, 1987.
11. E. Cohen. Fast algorithms for constructing spanners and paths with stretch J. SIAM Journal on Computing, 28:210-236, 1998.
12. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. IJCGA, 7:297-315, 1997.
13. M. de Berg, M. J. Katz, A. F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. In 13th SoCG, 1997.
14. D. Dor, S-Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM Journal on Computing, 29:1740-1759, 2000.
15. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric spanners. In 7th SWAT, LNCS, Vol. 1851, pp. 314-327, 2000.
16. D. Gusfield. Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge, UK, 1997
17. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13:338-355, 1984.
18. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete Computational Geometry, 7:13-28, 1992.
19. J. S. B. Mitchell. Shortest paths and networks. In Handbook of Discrete and Computational Geometry, pp. 445-466. CRC Press LLC, 1997.
20. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing, 30:978-989, 2000
21. M. H. Overmars and A. F. van der Stappen. Range searching and point location among fat objects. Journal of Algorithms, 21:629-656, 1996.
22. B. Schieber and U. Vishkin. On finding lowest common ancestors: simplifications and parallelisa-tions. SIAM Journal on Computing, 17:327-334, 1988.
23. M. Thorup and U-Zwick. Approximate distance oracles. In 33rd STOC, 2001.
24. A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11, 1982.