
An improved upper bound on the integrality ratio for the stpath TSP
We give an improved analysis of the bestofmany Christofides algorithm ...
read it

On the Spanning and Routing Ratio of ThetaFour
We present a routing algorithm for the Theta4graph that computes a pat...
read it

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...
read it

Another approach to nonrepetitive colorings of graphs of bounded degree
We propose a new proof technique that aims to be applied to the same pro...
read it

An Upper Bound for Wiretap Multiway Channels
A general model for wiretap multiway channels is introduced that includ...
read it

Bisimulation Finiteness of Pushdown Systems Is Elementary
We show that in case a pushdown system is bisimulation equivalent to a f...
read it

Lyndon Words, the Three Squares Lemma, and Primitive Squares
We revisit the socalled "Three Squares Lemma" by Crochemore and Rytter ...
read it
Improved Spanning on Theta5
We show an upper bound of sin(3π/10) /sin(2π/5)sin(3π/10) <5.70 on the spanning ratio of Θ_5graphs, improving on the previous best known upper bound of 9.96 [Bose, Morin, van Renssen, and Verdonschot. The Theta5graph is a spanner. Computational Geometry, 2015.]
READ FULL TEXT
Comments
There are no comments yet.