A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
Data Structures and Algorithms
2020-12-29 v1
Abstract
In this paper, we consider differential approximability of the traveling salesman problem (TSP). We show that TSP is -differential approximable, which improves the currently best known bound due to Escoffier and Monnot in 2008, where denotes the number of vertices in the given graph.
Cite
@article{arxiv.2012.14079,
title = {A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem},
author = {Yuki Amano and Kazuhisa Makino},
journal= {arXiv preprint arXiv:2012.14079},
year = {2020}
}