1. N. Christofides, 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. Approximation algorithms for some postman problems;Frederickson;Journal of the Association for Computing Machinery,1979
3. Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem;Guttmann-Beck;Algorithmica,2000
4. Analysis of Christofidesʼ heuristic: Some paths are more difficult than cycles;Hoogeveen;Operations Research Letters,1991
5. Combinatorial Optimization: Theory and Algorithms;Korte,2006