Improved Spanning on Theta-5

06/02/2021

∙

We show an upper bound of sin(3π/10) /sin(2π/5)-sin(3π/10) <5.70 on the spanning ratio of Θ_5-graphs, improving on the previous best known upper bound of 9.96 [Bose, Morin, van Renssen, and Verdonschot. The Theta-5-graph is a spanner. Computational Geometry, 2015.]

READ FULL TEXT

Improved Spanning on Theta-5

An improved upper bound on the integrality ratio for the s-t-path TSP

On the Spanning and Routing Ratio of Theta-Four

An almost optimal bound on the number of intersections of two simple polygons

Another approach to non-repetitive colorings of graphs of bounded degree

Exploration of graphs with excluded minors

Bisimulation Finiteness of Pushdown Systems Is Elementary

Optimal Lower Bounds for Sketching Graph Cuts

Improved Spanning on Theta-5

Related Research

An improved upper bound on the integrality ratio for the s-t-path TSP

On the Spanning and Routing Ratio of Theta-Four

An almost optimal bound on the number of intersections of two simple polygons

Another approach to non-repetitive colorings of graphs of bounded degree

Exploration of graphs with excluded minors

Bisimulation Finiteness of Pushdown Systems Is Elementary

Optimal Lower Bounds for Sketching Graph Cuts