论文标题
旅行推销员问题的3/4差分近似算法
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
论文作者
论文摘要
在本文中，我们考虑了旅行推销员问题（TSP）的差异性。我们表明，TSP为$ 3/4 $ -Differential近似值，这改善了由于Escoffier和Monnot的2008年，目前最著名的$ 3/4 -o（1/N）$，其中$ n $表示给定图中的顶点数量。
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.
