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.
翻译:在本文中,我们考虑了旅行销售商问题(TSP)的不同近似性。 我们发现TSP是3/4美元不等的,这改善了目前已知的3/4-O(1/n)美元的约束性,因为2008年的Escoffier和Monnot分别是3/4-O(1/n)美元和1美元,其中美元表示上图中的顶点数。