DeepAI AI Chat

Improved Spanning on Theta-5

06/02/2021

∙

by Prosenjit Bose, et al.

∙

∙

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.]

Prosenjit Bose
33 publications
Darryl Hill
3 publications
Aurélien Ooms
7 publications

page 1

page 2

page 3

page 4

∙ 08/31/2018

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

We give an improved analysis of the best-of-many Christofides algorithm ...

0 Vera Traub, et al. ∙

∙ 08/03/2018

On the Spanning and Routing Ratio of Theta-Four

We present a routing algorithm for the Theta-4-graph that computes a pat...

0 Prosenjit Bose, et al. ∙

∙ 02/13/2020

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

What is the maximum number of intersections of the boundaries of a simpl...

0 Eyal Ackerman, et al. ∙

∙ 06/16/2020

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

We propose a new proof technique that aims to be applied to the same pro...

0 Matthieu Rosenfeld, et al. ∙

∙ 11/30/2021

Acute Tours in the Plane

We confirm the following conjecture of Fekete and Woeginger from 1997: f...

0 Ahmad Biniaz, et al. ∙

∙ 05/13/2020

Bisimulation Finiteness of Pushdown Systems Is Elementary

We show that in case a pushdown system is bisimulation equivalent to a f...

0 Stefan Göller, et al. ∙

∙ 12/29/2017

Optimal Lower Bounds for Sketching Graph Cuts

We study the space complexity of sketching cuts and Laplacian quadratic ...

0 Charles Carlson, et al. ∙