A 7/8-approximation algorithm for metric Max TSP
Information Processing Letters
Improved approximation algorithms for metric max TSP
ESA'05 Proceedings of the 13th annual European conference on Algorithms
35/44-Approximation for asymmetric maximum TSP with triangle inequality
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An improved approximation algorithm for the maximum TSP
Theoretical Computer Science
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Single approximation for biobjective max TSP
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Single approximation for the biobjective Max TSP
Theoretical Computer Science
Discrete Applied Mathematics
| Hi-index | 5.23 |
We present the first 7/8-approximation algorithm for the maximum Traveling Salesman Problem (MAX-TSP) with triangle inequality. Our algorithm is deterministic. This improves over both the randomized algorithm of Hassin and Rubinstein [R. Hassin, S. Rubinstein, A 7/8-approximation algorithm for metric Max TSP, Inf. Process. Lett. 81 (5) (2002) 247-251] with an 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 [Z.-Z. Chen, T. Nagoya, Improved approximation algorithms for metric max TSP, in: Proc. ESA'05, 2005, pp. 179-190]. In the new algorithm, we extend the approach of processing local configurations using the so-called loose-ends, which we introduced in [L. Kowalik, M. Mucha, 35/44-approximation for asymmetric maximum TSP with triangle inequality, in: Proc. 10th Workshop on Algorithms and Data Structures, WADS'07, 2007, pp. 590-601].