1. Structure preserving reductions among convex optimization problems;Ausiello;J. Comput. System Sci.,1980
2. C. Bazgan, Approximation of optimization problems and total function of NP, Ph.D. Thesis, Université Paris Sud, 1998, available at http://www.lamsade.dauphine.fr/∼bazgan/Publications.html (in French).
3. Transformation of multi-salesmen problem to the standard traveling salesman problem;Bellmore;J. Assoc. Comput. Mach.,1974
4. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 338, Graduate School of Industrial Administration, CMU, 1976.
5. Combinatorial Optimization;Cook,1998