DeepAI
Log In Sign Up

A (Slightly) Improved Approximation Algorithm for Metric TSP

07/02/2020
by   Anna R. Karlin, et al.
0

For some ϵ > 10^-36 we give a 3/2-ϵ approximation algorithm for metric TSP.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/06/2020

A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

One of the most fundamental results in combinatorial optimization is the...
12/02/2019

An improved approximation algorithm for ATSP

We revisit the constant-factor approximation algorithm for the asymmetri...
03/21/2018

Similar Elements and Metric Labeling on Complete Graphs

We consider a problem that involves finding similar elements in a collec...
11/10/2017

Completely inapproximable monotone and antimonotone parameterized problems

We prove that weighted circuit satisfiability for monotone or antimonoto...
03/30/2021

Approximation algorithm for finding short synchronizing words in weighted automata

In this paper we are dealing with the issue of finding possibly short sy...
07/24/2018

Metric Sublinear Algorithms via Linear Sampling

In this work we provide a new technique to design fast approximation alg...
11/07/2018

Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm

Bribery in election (or computational social choice in general) is an im...