Improved Spanning on Theta-5
Prosenjit Bose (1), Darryl Hill (1), Aur\'elien Ooms ((1) Carleton, University)

TL;DR
This paper improves the upper bound on the spanning ratio of Theta-5 graphs from 9.96 to approximately 5.70, demonstrating a tighter bound on their efficiency as geometric spanners.
Contribution
The authors establish a new, significantly lower upper bound for the spanning ratio of Theta-5 graphs, advancing understanding of their geometric properties.
Findings
Upper bound of approximately 5.70 on the spanning ratio
Improved the previous bound of 9.96
Enhanced understanding of Theta-5 graph efficiency
Abstract
We show an upper bound of on the spanning ratio of -graphs, improving on the previous best known upper bound of [Bose, Morin, van Renssen, and Verdonschot. The Theta-5-graph is a spanner. Computational Geometry, 2015.]
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Digital Image Processing Techniques
