1. Ageev, A.A., Baburin, A.E., Gimadi, E.K.: A polynomial algorithm with an accuracy estimate of 3/4 for finding two nonintersecting Hamiltonian cycles of maximum weight (in Russian). Diskretn. Anal. Issled. Oper. Ser. 13(2), 11–20 (2006)
2. Baburin, A.E., Gimadi, E.K., Korkishko, N.M.: Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight (in Russian), Diskretn. Anal. Issled. Oper. Ser. 2. 11(1), 11–25 (2004)
3. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report CS-93-13, Carnegie Mellon University (1976)
4. De Brey, M.J.D., Volgenant, A.: Well-solved cases of the 2-peripatetic salesman problem. Optimization 39(3), 275–293 (1997)
5. Duchenne, E., Laporte, G., Semet, F.: Branch-and-cut algorithms for the undirected m-peripatetic salesman problem. European J. Oper. Res. 162(3), 700–712 (2005)