A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem

12/28/2020 ∙ by Yuki Amano, et al. ∙ 0

In this paper, we consider differential approximability of the traveling salesman problem (TSP). We show that TSP is 3/4-differential approximable, which improves the currently best known bound 3/4 -O(1/n) due to Escoffier and Monnot in 2008, where n denotes the number of vertices in the given graph.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.