Abstract
Under study is the maximum 2 peripatetic salesmen problem which consists in finding two edge-disjoint Hamiltonian cycles with maximal total weight in a complete undirected graph. We present a cubic time approximation algorithm for this problem with the performance guarantee 7/9 which is the best known estimation by now. We also present a modification of this algorithm for the case when the weights of graph edges are values in a given range [1, q] with the performance guarantee (7q + 3)/(9q + 1) which is also the best known estimation by now and has cubic time complexity too.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. A. Ageev, A. E. Baburin, and E. Kh. Gimadi, “A 3/4-Approximation Algorithm for Finding Two Disjoint Hamiltonian Cycles of Maximum Weight,” Diskret. Anal. Issled. Oper. Ser 1, 13(2), 11–20 (2006) [J. Appl. Indust. Math. 1 (2), 142–147 (2007)].
E. Kh. Gimadi, Yu. V. Glazkov, and A. N. Glebov, “Approximation Algorithms for Solving the 2-Peripatetic Salesmen Problem on a Complete Graph with Edge Weights 1 and 2,” Diskret. Anal. Issled. Oper. Ser 2, 14(2), 41–61 (2007) [J. Appl. Indust. Math. 3 (1), 46–60 (2009)].
A. I. Serdyukov, “An Algorithm with an Estimate for a Salesman Problem forMaximum,” in Proceedings of the Institute of Mathematics: Controlled Systems, Vol. 25 (Inst. Mat., Novosibirsk, 1984), pp. 80–86.
Z.-Z. Chen, Y. Okamoto, and L. Wang, “Improved Deterministic Approximation Algorithms for Max TSP,” Inform. Process. Lett. 95(2), 333–342 (2005).
Z.-Z. Chen and L. Wang, “An Improved Randomized Approximation Algorithm for Max TSP,” J. Comb. Optim. 9(4), 401–432 (2005).
M. J. D. De Brey and A. Volgenant, “Well-Solved Cases of the 2-Peripatetic Salesman Problem,” Optimization 39(3), 275–293 (1997).
J. B. J.M. De Kort, “Lower Bounds for SymmetricK-Peripatetic Salesman Problems,” Optimization 22(1), 113–122 (1991).
J. B. J. M. De Kort, “Upper Bounds for the Symmetric 2-Peripatetic Salesman Problem,” Optimization 23(4), 357–367 (1992).
J. B. J. M. De Kort, “A Branch and Bound Algorithm for Symmetric 2-Peripatetic Salesman Problems,” European J. Oper. Res. 70(2), 229–243 (1993).
E. Duchenne, G. Laporte, and F. Semet, “Branch-and-Cut Algorithms for the Undirected m-Peripatetic Salesman Problem,” European J. Oper. Res. 162(3), 700–712 (2005).
H. N. Gabow, “An Efficient Reduction Technique for Degree-Restricted Subgraph and Bidirected Network Flow Problems,” in Proceedings of the 15th Annual ACMSymposium on Theory of Computing (Boston, April 25–27, 1983) (New York, ACM, 1983), pp. 448–456.
R. Hassin and S. Rubinstein, “Better Approximations for max TSP,” Inform. Process. Lett. 75(4), 181–186 (2000).
J. Krarup, “The Peripatetic Salesman and Some Related Unsolved Problems,” in Combinatorial Programming: Methods and Applications: Proceedings of NATO Advanced Study Institute, Versailles, 1974 (Reidel, Dordrecht, 1975), pp. 173–178.
A. van Zuylen, “Multiplying Pessimistic Estimators: Deterministic Approximation of max TSP and Maximum Triangle Packing,” in Computing and Combinatorics: Proceedings of 16th Annual International Conference COCOON 2010 (Nha Trang, Vietnam, July 19–21, 2010), pp. 60–69.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.N. Glebov, D.Zh. Zambalaeva, 2011, published in Diskretnyi Analiz i Issledovanie Operatsii, 2011, Vol. 18, No. 4, pp. 84–88.
Rights and permissions
About this article
Cite this article
Glebov, A.N., Zambalaeva, D.Z. A polynomial algorithm with approximation ratio 7/9 for the maximum two peripatetic salesmen problem. J. Appl. Ind. Math. 6, 69–89 (2012). https://doi.org/10.1134/S1990478912010085
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478912010085