Finding the best shortcut in a geometric network

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 327-335

  Farshi, Mohammad ^a   Giannopoulos, Panos ^b   Gudmundsson, Joachim ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c CSIRO   (Australia)

Author keywords

Approximation algorithms; Computational Geometry; Geometric networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; EUCLIDEAN GRAPH; GEOMETRIC NETWORKS; OPTIMAL SOLUTION;

COMPUTATIONAL GEOMETRY;

EID: 33244497615     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064143     Document Type: Conference Paper

References (31)

1. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81-100, 1993.
2. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder. Geometric spanners for wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems, 14(4):408-421, 2003.
3. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. 27th ACM Symposium on Theory of Computing, pages 489-498, 1995.
4. S. Arya, D. M. Mount, and M. Smid. Randomized and deterministic algorithms for geometric spanners of small diameter. In Proc. 35th IEEE Symposium on Foundations of Computer Science, pages 703-712, 1994.
5. P. Bose, J. Gudmundsson, and P. Morin. Ordered theta graphs. Computational Geometry: Theory and Applications, 28:11-18, 2004.
6. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM, 42:67-90, 1995.
7. A. Czumaj and A. Lingas. Fast approximation schemes for Euclidean multi-connectivity problems. In Proc. 27th International Colloquium on Automata, Languages and Programming, volume 1853 of Lecture Notes in Computer Science, pages 856-868. Springer-Verlag, 2000.
8. G. Das, P. Heffernan, and G. Narasimhan. Optimally sparse spanners in 3-dimensional Euclidean space. In Proc. 9th Annual ACM Symposium on Computational Geometry, pages 53-62, 1993.
9. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. International Journal of Computational Geometry and Applications, 7:297-315, 1997.
10. G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, pages 215-222, 1995.
11. A. Ebbers-Baumann, R. Klein, E. Langetepe, and A. Lingas. A fast algorithm for approximating the detour of a polygonal chain. In Proc. 9th European Symposium on Algorithms, volume 2161 of Lecture Notes in Computer Science, pages 321-332, Springer-Verlag, 2001.
12. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier Science Publishers, Amsterdam, 2000.
13. D. Eppstein and K. Wortman. Minimum dilation stars. In Proc. 21th ACM Symposium on Computational Geometry, 2005.
14. A. M. Farley, A. Proskurowski, D. Zappala, and K. J. Windisch. Spanners and message distribution in networks. Discrete Applied Mathematics, 137(2):159-171, 2004.
15. p. Manuscript, March 2005.
16. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric spanners. SIAM Journal of Computing, 31(5):1479-1500, 2002.
17. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles revisited. In Proc. 13th International Symposium on Algorithms and Computation, volume 2518 of Lecture Notes in Computer Science, pages 357-368, Springer-Verlag, 2002.
18. J. Gudmundsson, G. Narasimhan, and M. Smid. Fast pruning of geometric spanners. In Proc. 22nd International Symposium on Theoretical Aspects of Computer Science, volume 3404 of Lecture Notes in Comp. Science, pages 508-520, Springer-Verlag, 2005.
19. J. M. Keil. Approximating the complete Euclidean graph. In Proc. 1st Scandinavian Workshop on Algorithmic Theory, volume 318 of Lecture Notes in Computer Science, pages 208-213, Springer-Verlag, 1988.
20. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete and Computational Geometry, 7:13-28, 1992.
21. S. Langerman, P. Morin, and M. A. Soss. Computing the maximum detour and spanning ratio of planar paths trees, and cycles. In Proc. 19th International Symposium on Theoretical Aspects of Computer Science, volume 2285 of Lecture Notes in Computer Science, pages 250-261, Springer-Verlag, 2002.
22. C. Levcopoulos and A. Lingas. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica, 8:251-256, 1992.
23. C. Levcopoulos, G. Narasimhan, and M. Smid. Improved algorithms for constructing fault-tolerant spanners. Algorithmica, 32:144-156, 2002.
24. X.-Y. Li. Applications of computational geomety in wireless ad hoc networks. In X.-Z. Cheng, X. Huang, and D.-Z. Du, editors, Ad Hoc Wireless Networking. Kluwer, 2003.
25. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM Journal of Computing, 30(3):978-989, 2000.
26. G. Navarro and R. Paredes. Practical construction of metric t-spanners. In Proc. 5th SIAM Workshop on Algorithm Engineering and Experiments, pages 69-81, 2003.
27. G. Navarro, R. Paredes, and E. Chvez. t-spanners as a data structure for metric space searching. In Proc. 9th International Symposium on String Processing and Information Retrieval, volume 2476 of Lecture Notes in Comp. Science, pages 298-309. Springer-Verlag, 2002.
28. S. Rao and W. D. Smith. Approximating geometrical graphs via spanners and banyans. In Proc. 30th ACM Symposium on the Theory of Computing, pages 540-550, 1998.
29. J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry & Applications, 1:99-107, 1991.
30. M. Smid. Closest point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877-935. Elsevier Science Publishers, Amsterdam, 2000.
31. P. M. Vaidya. A sparse graph almost as good as the complete graph on points in K dimensions. Discrete Computational Geometry, 6:369-381, 1991.