1. The Probabilistic Method;Alon,1992
2. Algorithmic Number Theory, Vol. 1;Bach,1996
3. E. Balas, N. Simonetti, Linear time dynamic programming algorithms for some new classes of restricted TSP's, Proceedings of the IPCO V, Lecture Notes in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 316–329.
4. The Theory of Graphs;Berge,1958
5. R.E. Burkard, V.G. Deineko, G.J. Woeginger, The travelling salesman problem and the PQ-tree, Proceedings of the IPCO V, Lecture Notes in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 490–504.