Approximating geometric bottleneck shortest paths

Computational Geometry: Theory and Applications

Volumn 29, Issue 3, 2004, Pages 233-249

  Bose, Prosenjit ^a   Maheshwari, Anil ^a   Narasimhan, Giri ^b   Smid, Michiel ^a   Zeh, Norbert ^c  

^a CARLETON UNIVERSITY   (Canada)

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

^c DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867955881     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.04.003     Document Type: Article

References (16)

1. S. Arya, G. Das, D.M. Mount, J.S. Salowe, and M. Smid Euclidean spanners: short, thin, and lanky Proceedings of the 27th ACM Symposium on the Theory of Computing 1995 489 498
2. M.A. Bender, and M. Farach-Colton The LCA problem revisited Proceedings of the 4th Latin American Symposium on Theoretical Informatics Lecture Notes in Computer Science vol. 1776 2000 Springer-Verlag Berlin 88 94
3. P. Bose, J. Gudmundsson, and M. Smid Constructing plane spanners of bounded degree and low weight Proceedings of the 10th European Symposium on Algorithms Lecture Notes in Computer Science vol. 2461 2002 Springer-Verlag Berlin 234 246
4. M.S. Chang, N.-F. Huang, and C.-Y. Tang An optimal algorithm for constructing oriented Voronoi diagrams and geographic neighborhood graphs Information Processing Letters 35 1990 255 260
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms second ed. 2001 MIT Press Cambridge, MA
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications second ed. 2000 Springer-Verlag Berlin
7. H.N. Djidjev Efficient algorithms for shortest path queries in planar digraphs Proceedings of the 22nd Workshop on Graph Theoretic Concepts in Computer Science Lecture Notes in Computer Science vol. 1197 1996 Springer-Verlag Berlin 151 165
8. D. Eppstein Spanning trees and spanners J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Amsterdam 425 461
9. D. Harel, and R.E. Tarjan Fast algorithms for finding nearest common ancestors SIAM J. Comput 13 1984 338 355
10. J.M. Keil, and C.A. Gutwin Classes of graphs which approximate the complete Euclidean graph Discrete Comput. Geom 7 1992 13 28
11. G. Narasimhan, and M. Smid Approximation algorithms for the bottleneck stretch factor problem Nordic J. Comput 9 2002 13 31
12. D.M. Neto, Efficient cluster compensation for Lin-Kernighan heuristics, PhD thesis, Department of Computer Science, University of Toronto, Toronto, Canada, 1999
13. B. Schieber, and U. Vishkin On finding lowest common ancestors: simplifications and parallelisations SIAM J. Comput 17 1988 327 334
14. M. Smid Closest-point problems in computational geometry J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Amsterdam 877 935
15. I. Stojmenovic Handbook of Wireless Networks and Mobile Computing 2002 Wiley
16. A.C. Yao On constructing minimum spanning trees in k-dimensional spaces and related problems SIAM J. Comput 11 4 1982 721 736