AI Chat AI Image Generator AI Video Text to Speech

A (Slightly) Improved Approximation Algorithm for Metric TSP

07/02/2020

∙

by Anna R. Karlin, et al.

∙

∙

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

Anna R. Karlin
9 publications
Nathan Klein
9 publications
Shayan Oveis Gharan
25 publications

page 1

page 2

page 3

page 4

research

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

0 René van Bevern, et al. ∙

research

∙ 12/13/2022

A (Slightly) Improved Deterministic Approximation Algorithm for Metric TSP

We show that the max entropy algorithm can be derandomized (with respect...

0 Anna R. Karlin, et al. ∙

research

∙ 12/02/2019

An improved approximation algorithm for ATSP

We revisit the constant-factor approximation algorithm for the asymmetri...

0 Vera Traub, et al. ∙

research

∙ 03/21/2018

Similar Elements and Metric Labeling on Complete Graphs

We consider a problem that involves finding similar elements in a collec...

0 Pedro F. Felzenszwalb, et al. ∙

research

∙ 07/14/2023

A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots

One of the most studied extensions of the famous Traveling Salesperson P...

0 Max Deppert, et al. ∙

research

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

0 Jakub Ruszil, et al. ∙

research

∙ 07/24/2018

Metric Sublinear Algorithms via Linear Sampling

In this work we provide a new technique to design fast approximation alg...

0 Hossein Esfandiari, et al. ∙