1. Lecture Notes in Computer Science;A.I. Barvinok,1998
2. Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved Deterministic Approximation Algorithms for Max TSP. To appear in Information Processing Letters
3. Hassin, R., Rubinstein, S.: A 7/8-Approximation Approximations for Metric Max TSP. Information Processing Letters 81, 247–251 (2002)
4. Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 56–75 (2003)
5. Kostochka, A.V., Serdyukov, A.I.: Polynomial Algorithms with the Estimates
$\frac{3}{4}$
and
$\frac{5}{6}$
for the Traveling Salesman Problem of Maximum (in Russian). Upravlyaemye Sistemy 26, 55–59 (1985)