1. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976)
2. Serdyukov, A.I.: An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy 25, 80–86 (1984)
3. Chen, Z.Z., Nagoya, T.: Improved approximation algorithms for metric MaxTSP. J. Comb. Optim. 13(4), 321–336 (2007)
4. Lecture Notes in Computer Science;G. Ausiello,2006
5. Lecture Notes in Computer Science;H.J. Böckenhauer,2008