1. Z.-Z. Chen, T. Nagoya, Improved approximation algorithms for metric max TSP, in: Proc. ESA’05, 2005, pp. 179–190
2. A 7/8-approximation algorithm for metric Max TSP;Hassin;Inf. Process. Lett.,2002
3. Polynomial algorithms with the estimates 3/4 and 5/6 for the traveling salesman problem of the maximum;Kostochka;Upravlyaemye Sistemy,1985
4. Ł. 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
5. The traveling salesman problem of the maximum;Serdyukov;Upravlyaemye Sistemy,1984