LIPIcs.ISAAC.2024.15.pdf
- Filesize: 0.87 MB
- 17 pages
Document
On the Spanning and Routing Ratios of the Yao-Four Graph
Authors
Prosenjit Bose 
,
-
Part of:
Volume:
35th International Symposium on Algorithms and Computation (ISAAC 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Algorithms and Computation (ISAAC) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-12-04
File
Document Identifiers
Author Details
Acknowledgements
We would like to thank an anonymous reviewer for suggestions to improve the presentation and for pointing out an error in our original proof of Lemma 7.
Cite As Get BibTex
Prosenjit Bose, Darryl Hill, Michiel Smid, and Tyler Tuttle. On the Spanning and Routing Ratios of the Yao-Four Graph. In 35th International Symposium on Algorithms and Computation (ISAAC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 322, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ISAAC.2024.15
Abstract
The Yao graph is a geometric spanner that was independently introduced by Yao [SIAM J. Comput., 1982] and Flinchbaugh and Jones [SIAM J. Algebr. Discret. Appl., 1981]. We prove that for any two vertices of the undirected version of the Yao graph with four cones, there is a path between them with length at most 13 + 5/√2 ≈ 16.54 times the Euclidean distance between the vertices, improving the previous best bound of approximately 54.62. We also present an online routing algorithm for the directed Yao graph with four cones that constructs a path between any two vertices with length at most 17 + 9/√2 ≈ 23.36 times the Euclidean distance between the vertices. This is the first routing algorithm for a directed Yao graph with fewer than six cones. The algorithm uses knowledge of the coordinates of the current vertex, the (up to) four neighbours of the current vertex, and the destination vertex to make a routing decision. It also uses one additional bit of memory. We show how to dispense with this single bit at the cost of increasing the length of the path to √{331 + 154√2} ≈ 23.43 times the Euclidean distance between the vertices.
Subject Classification
ACM Subject Classification
- Theory of computation → Computational geometry
Keywords
- Yao graph
- online routing
- geometric spanners
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- B. E. Flinchbaugh and L. K. Jones. Strong connectivity in directional nearest-neighbour graphs. SIAM Journal on Algebraic Discrete Methods, 2(4):461-463, 1981. URL: https://doi.org/10.1137/0602049.
- Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, and Ge Xia. New and improved spanning ratios for Yao graphs. In Proceedings of the Thirtieth Annual Symposium on Computational Geometry, SOCG'14, pages 30-39, New York, NY, USA, 2014. Association for Computing Machinery. URL: https://doi.org/10.1145/2582112.2582143.
- Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, and Michiel Smid. On the spanning and routing ratio of theta-four. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2361-2370. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.144.
- Kenneth L. Clarkson. Approximation algorithms for shortest path motion planning. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 56-65, 1987. URL: https://doi.org/10.1145/28395.28402.
-
Nawar M El Molla. Yao spanners for wireless ad hoc networks. Villanova University, 2009.
- Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993. URL: https://doi.org/10.1007/BF02189308.
-
William Michael Zoltan Kalnay. Routing Ratio of the Directed Yao-6 Graphs. Carleton University, 2023.
- J. Mark Keil. Approximating the complete Euclidean graph. In 1st Scandinavian Workshop on Algorithm Theory, volume 318 of Lecture Nodes in Computer Science, pages 208-213, 1988. URL: https://doi.org/10.1007/3-540-19487-8_23.
- Mirela Damian and Kristin Raudonis. Yao graphs span theta graphs. In Combinatorial Optimization and Applications COCOA 2010, volume 6509 of Lecture Nodes in Computer Science, pages 181-194, 2010. URL: https://doi.org/10.1007/978-3-642-17461-2_15.
- Mirela Damian and Naresh Nelavalli. Improved bounds on the stretch factor of Y₄. Computational Geometry, 62:14-24, 2017. URL: https://doi.org/j.comgeo.2016.12.001.
- Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel Smid, and Norbert Zeh. Approximating geometric bottleneck shortest paths. Computational Geometry, 29(3):233-249, 2004. URL: https://doi.org/10.1016/j.comgeo.2004.04.003.
- Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, and Stefanie Wuhrer. π/2-angle Yao graphs are spanners. In Algorithms and Computation - 21st International Symposium, ISAAC 2010, volume 6507 of Lecture Nodes in Computer Science, pages 446-457, 2010. URL: https://doi.org/10.1007/978-3-642-17514-5_38.
- Andrew Chi-Chih Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721-736, 1982. URL: https://doi.org/10.1137/0211059.
X
Feedback for Dagstuhl Publishing
Thanks for your feedback!
Feedback submitted
Could not send message
Please try again later or send an E-mail