Improved Approximation Algorithms for Metric Max TSP

We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is 27 35 . The other is for undirected graphs and its approximation ratio is 7 8 −o(1). Both algorithms improve on the previous bests.

• Type: Conference
• Year: 2005
• Where: ESA
• Authors: Zhi-Zhong Chen, Takayuki Nagoya
• Keywords: Approximation Ratio, ESA 2005, Maximum Traveling Salesman, Polynomial-time Approximation Algorithms