
A historical note on the 3/2approximation algorithm for the metric traveling salesman problem
One of the most fundamental results in combinatorial optimization is the...
read it

A 2Approximation Algorithm for Flexible Graph Connectivity
We present a 2approximation algorithm for the Flexible Graph Connectivi...
read it

An improved approximation algorithm for ATSP
We revisit the constantfactor approximation algorithm for the asymmetri...
read it

Similar Elements and Metric Labeling on Complete Graphs
We consider a problem that involves finding similar elements in a collec...
read it

Completely inapproximable monotone and antimonotone parameterized problems
We prove that weighted circuit satisfiability for monotone or antimonoto...
read it

Approximation algorithm for finding short synchronizing words in weighted automata
In this paper we are dealing with the issue of finding possibly short sy...
read it

Metric Sublinear Algorithms via Linear Sampling
In this work we provide a new technique to design fast approximation alg...
read it
A (Slightly) Improved Approximation Algorithm for Metric TSP
For some ϵ > 10^36 we give a 3/2ϵ approximation algorithm for metric TSP.
READ FULL TEXT
Comments
There are no comments yet.