Deterministic 7/8-Approximation for the Metric Maximum TSP

We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the randomized algorithm of Hassin and Rubinstein [2] with expected approximation ratio of 7/8-O(n-1/2) and the deterministic (7/8-O(n-1/3))approximation algorithm of Chen and Nagoya [1]. In the new algorithm, we extend the approach of processing local configurations using so-called loose-ends, which we introduced in [4].

• Type: Conference
• Year: 2008
• Where: APPROX
• Authors: Lukasz Kowalik, Marcin Mucha
• Keywords: 7/8-approximation Algorithm, Algorithm, Algorithms, APPROX 2008, Maximum Traveling Salesman