Advertisement

Journal of Combinatorial Optimization

, Volume 27, Issue 1, pp 78–87 | Cite as

On certain geometric properties of the Yao–Yao graphs

  • Iyad A. Kanj
  • Ge Xia
Article

Abstract

We show that, for any constant \(\rho > 1\), there exists an integer constant \(k\) such that the Yao–Yao graph with parameter \(k\) defined on a civilized unit disk graph is a geometric spanner of stretch factor \(\rho \). This improves the results of Wang and Li in several aspects, as described in the paper. This partially answers an open problem posed by Demaine, Mitchell and O’Rourke about the spanner properties of Yao–Yao graphs. We also show that the Yao–Yao graph with parameter \(k=4\) defined on the complete Euclidean graph is not plane.

Keywords

Yao graphs Yao–Yao graphs Unit disk graphs Spanners 

References

  1. Althöfer I, Das G, Dobkin D, Joseph D, Soares J (1993) On sparse spanners of weighted graphs. Discret. Comput. Geom. 9:81–100CrossRefMATHGoogle Scholar
  2. Bauer M, Damian M (2012) An infinite class of sparse-yao spanners. CoRR, abs/1206.3628Google Scholar
  3. Bose P, Damian M, Douïeb K, O’Rourke J, Seamone B, Smid M, Wuhrer S (2010) \(\pi /2\)-angle Yao graphs are spanners. In 21st international symposium on algorithms and computation, vol 6507 of Lecture Notes in Computer Science. Springer, pp 446–457Google Scholar
  4. Bose P, Damian M, Douïeb K, O’Rourke J, Seamone B, Smid M, Wuhrer S (2010) \(\pi /2\)-angle Yao graphs are spanners. CoRR, abs/1001.2913Google Scholar
  5. Bose P, Gudmundsson J, Smid M (2005) Constructing plane spanners of bounded degree and low weight. Algorithmica 42(3–4):249–264CrossRefMATHMathSciNetGoogle Scholar
  6. Bose P, Morin P, Stojmenovic I, Urrutia J (2001) Routing with guaranteed delivery in ad hoc wireless networks. Wirel NetW 7(6):609–616CrossRefMATHGoogle Scholar
  7. Damian M, Molla N, Pinciu V (2009) Spanner properties of \(\pi /2\)-angle yao graphs. In Proceedings of the 25th European Workshop on, Computational Geometry, pp 21–24Google Scholar
  8. Damian M, Raudonis K (2010) Yao graphs span theta graphs. In Proceedings of the 4th international conference on Combinatorial optimization and applications—vol Part II, COCOA’10. Springer, Berlin, pp 181–194Google Scholar
  9. Das G, Heffernan P, Narasimhan G (1993) Optimally sparse spanners in 3-dimensional Euclidean space. In proceedings of the 19th ACM symposium on, computational geometry, pp 53–62Google Scholar
  10. Das G, Narasimhan G (1994) A fast algorithm for constructing sparse Euclidean spanners. In proceedings of the 20th ACM symposium on, computational geometry, pp 132–139Google Scholar
  11. Das G, Narasimhan G, Salowe J (1995) A new way to weigh malnourished Euclidean graphs. In proceedings of the sixth annual ACM-SIAM symposium on discrete algorithms, pp 215–222Google Scholar
  12. Demaine E, Mitchell J, O’Rourke J (eds.) (2008) The open problems project: Problem 70. Available at: http://maven.smith.edu/~orourke/TOPP/P70.html
  13. Gudmundsson J, Levcopoulos C, Narasimhan G (2002) Fast greedy algorithms for constructing sparse geometric spanners. SIAM J Comput 31(5):1479–1500CrossRefMATHMathSciNetGoogle Scholar
  14. Kanj I, Perković L, Xia G (2010) On spanners and lightweight spanners of geometric graphs. SIAM J Comput 39(6):2132–2161CrossRefMATHMathSciNetGoogle Scholar
  15. Keil J, Gutwin C (1992) Classes of graphs which approximate the complete Euclidean graph. Discret Comput Geom 7:13–28CrossRefMATHMathSciNetGoogle Scholar
  16. Kranakis E, Singh H, Urrutia J (1999) Compass routing on geometric networks. In proceedings of the 11th Canadian Conference on, Computational Geometry, pp 51–54Google Scholar
  17. Levcopoulos C, Lingas A (1992) There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica 8(3):251–256CrossRefMATHMathSciNetGoogle Scholar
  18. Li X-Y, Calinescu G, Wan P-J, Wang Y (2003) Localized delaunay triangulation with application in Ad Hoc wireless networks. IEEE Trans Parallel Distrib Syst 14(10):1035–1047CrossRefGoogle Scholar
  19. Molla N (2009) Yao spanners for wireless ad hoc networks. M.S. Thesis, Department of Computer Science, Villanova University, Dec 2009Google Scholar
  20. Narasimhan G, Smid M (2007) Geometric Spanner Networks. Cambridge University Press, CambridgeGoogle Scholar
  21. Wang Y, Li X-Y (2002) Distributed spanner with bounded degree for wireless ad hoc networks. In proceedings of the 16th international parallel and distributed processing symposiumGoogle Scholar
  22. Wang Y, Li X-Y (2006) Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mobile NetW Appl 11(2):161–175CrossRefGoogle Scholar
  23. Yao AC-C (1982) On constructing minimum spanning trees in \(k\)-dimensional spaces and related problems. SIAM J Comput 11(4):721–736CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2012

Authors and Affiliations

  1. 1.School of ComputingDePaul UniversityChicagoUSA
  2. 2.Department of Computer Science, Acopian Engineering CenterLafayette CollegeEastonUSA

Personalised recommendations