Approximating the stretch factor of Euclidean graphs

SIAM Journal on Computing

Volumn 30, Issue 3, 2000, Pages 978-989

  Narasimhan, Giri ^a   Smid, Michiel ^b  

^a University of Memphis   (United States)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Approximate shortest paths; Computational geometry; Spanners; Well separated pairs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY;

EUCLIDEAN GRAPHS;

GRAPH THEORY;

EID: 0034947003     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799361671     Document Type: Article

References (24)

1. I. ALTHÖFER, G. DAS, D. P. DOBKIN, D. JOSEPH, AND J. SOARES, On sparse spanners of weighted graphs, Discrete Comput. Geom., 9 (1993), pp. 81-100.
2. S. R. 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 Algorithms - ESA '96, Fourth Annual European Symposium, Lecture Notes in Comput. Sci. 1136, Springer-Verlag, New York, 1996, pp. 514-528.
3. S. ARORA, M. GRIGNI, D. KARGER, P. KLEIN, AND A. WOLOSZYN, A polynomial-time approximation scheme for weighted planar graph TSP, in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 33-41.
4. S. ARYA, G. DAS, D. M. MOUNT, J. S. SALOWE, AND M. SMID, Euclidean spanners: Short, thin, and lanky, in Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, San Francisco, SIAM, Philadelphia, 1995, pp. 489-498.
5. M. BEN-OR, Lower bounds for algebraic computation trees, in Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, 1983, pp. 80-86.
6. P. B. CALLAHAN AND S. R. KOSARAJU, Faster algorithms for some geometric graph problems in higher dimensions, in Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, SIAM, Philadelphia, 1993, pp. 291-300.
7. P. B. CALLAHAN AND S. R. KOSARAJU, A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields, J. ACM, 42 (1995), pp. 67-90.
8. B. CHANDRA, G. DAS, G. NARASIMHAN, AND J. SOARES, New sparseness results on graph spanners, Internat. J. Comput. Geom. Appl., 5 (1995), pp. 125-144.
9. E. COHEN, Fast algorithms for constructing t-spanners and paths with stretch t, SIAM J. Comput., 28 (1998), pp. 210-236.
10. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
11. G. DAS AND G. NARASIMHAN, A fast algorithm for constructing sparse Euclidean spanners, Internat. J. Comput. Geom. Appl., 7 (1997), pp. 297-315.
12. D. P. DOBKIN, S. J. FRIEDMAN, AND K. J. SUPOWIT, Delaunay graphs are almost as good as complete graphs, Discrete Comput. Geom., 5 (1990), pp. 399-407.
13. D. EPPSTEIN, Beta-Skeletons Have Unbounded Dilation, Technical Report 96-15, Department of Information and Computer Science, University of California, Irvine, CA, 1996.
14. D. EPPSTEIN, Spanning trees and spanners, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier Science, Amsterdam, 1999, pp. 425-461.
15. G. N. FREDERICKSON, Fast algorithms for shortest paths in planar graphs, with applications, SIAM J. Comput., 16 (1987), pp. 1004-1022.
16. D. HAREL AND R. E. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
17. J. M. KEIL AND C. A. GUTWIN, Classes of graphs which approximate the complete Euclidean graph, Discrete Comput. Geom., 7 (1992), pp. 13-28.
18. C. LEVCOPOULOS, G. NARASIMHAN, AND M. SMID, Efficient algorithms for constructing fault-tolerant geometric spanners, in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, 1998, pp. 186-195.
19. N. LINIAL, E. LONDON, AND Y. RABINOVICH, The geometry of graphs and some of its algorithmic applications, Combinatorica, 15 (1995), pp. 215-245.
20. G. NARASIMHAN AND M. SMID, Approximating the stretch factor of Euclidean paths, cycles and trees, Report 9, Department of Computer Science, University of Magdeburg, Magdeburg, Germany, 1999.
21. D. PFLEG AND A. SCHÄFFER, Graph spanners, J. Graph Theory, 13 (1989), pp. 99-116.
22. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry: An Introduction, Springer-Verlag, Berlin, 1988.
23. S. RAO AND W. D. SMITH, Approximating geometrical graphs via "spanners" and "banyans," in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, 1998, pp. 540-550.
24. M. SMID, Closest-point problems in computational geometry, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier Science, Amsterdam, 1999, pp. 877-935.