1. N. Christofides, Worst case analysis of a new heuristic for the traveling salesman problem, Technical Report 388, GSIA, Carnegie Mellon University, 1976.
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, second ed., MIT Press, Cambridge, MA, ISBN 0-262-03293-7, 2001.
3. Building chain and cactus representations of all minimum cuts from Hao–Orlin in the same asymptotic run time;Fleischer;J. Algorithms,1999
4. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem;Frieze;Networks,1982
5. M.R. Garey, D.S. Jonsson, Computers and Interactability, A Guide to the Theory of NP-Completeness, vol. 259, W.H. Freeman and company, New York, ISBN 0-7167-1045-5, 1979.