Abstract
We present a polynomial algorithm with guaranteed approximation ratio 5/6 for the metric maximization version of the m-PSP with identical weight functions. This result extends the well-known algorithm by Kostochka and Serdyukov for the metric TSP (1985) to the case of several Hamiltonian cycles and improves the approximation ratio of the algorithm by Gordeeva (2010) for the metric 2-PSP.
A.N. Glebov—The work is supported by RFBR (projects 15-01-00976 and 15-01-05867).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ageev, A.A., Baburin, A.E., Gimadi, E.: A 3/4 approximation algorithm for finding two disjoint Hamiltonian cycles of maximum weight. Diskretn. Anal. Issled. Oper. Ser. 1 13(2), 11–20 (2006). (in Russian)
Ageev, A.A., Pyatkin, A.V.: A 2-approximation algorithm for the metric 2-peripatetic salesman problem. Diskretn. Anal. Issled. Oper. 16(4), 3–20 (2009). (in Russian)
Baburin, A.E., Gimadi, E.Kh.: On the asymptotic optimality of an algorithm for solving the maximization version of the m-PSP in a multidimensional euclidean space. Proc. Steklov Inst. Math. 272(1), 1–13 (2011)
Baburin, A.E., Gimadi, E.Kh., Korkishko, N.M.: Approximation algorithms for finding two edge-disjoint hamiltonian cycles of minimal total weight. Diskretn. Anal. Issled. Oper. Ser 2 11(1), 11–25 (2004). (in Russian)
Wolfter Calvo, R., Cordone, R.: A heuristic approach to the overnight security service problem. Comput. Oper. Res. 30, 1269–1287 (2003)
Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report CS-93-13, Carnegie Mellon University (1976)
De Brey, M.J.D., Volgenant, A.: Well-solved cases of the 2-peripatetic salesman problem. Optimization 39(3), 275–293 (1997)
De Kort, J.B.J.M.: Upper bounds for the symmetric 2-PSP. Optimization 23(4), 357–367 (1992)
De Kort, J.B.J.M.: Lower bounds for symmetric \(K\)-PSP. Optimization 22(1), 113–122 (1991)
De Kort, J.B.J.M.: A branch and bound algorithm for symmetric 2-PSP. EJOR 70, 229–243 (1993)
Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 3(2), 69–81 (1952)
Gabow, H.N.: An efficient reduction technique for degree-restricted subgraph and bidirected network flow problems. In: Proceedings of 15th Annual ACM Symposium on Theory of Computing, pp. 448–456. ACM, New York (1983)
Gimadi, E.Kh.: Approximation efficient algorithms with performance guarantees for some hard routing problems. In: Proceedings of II International Conference ‘Optimzation and Applications’ OPTIMA-2011, pp. 98–101. Petrovac, Montenegro (2011)
Gimadi, E.Kh.: Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in euclidean space. Proc. Steklov Inst. Math. 263(2), 56–67 (2008)
Gimadi, E.Kh., Ivonina, E.V.: Approximation algorithms for the maximum 2-peripatetic salesman problem. Diskretn. Anal. Issled. Oper. 19(1), 17–32 (2012). (in Russian)
Gimadi, E.Kh., Glazkov, Yu.V., Glebov, A.N.: Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2. Diskretn. Anal. Issled. Oper. Ser 2. 14(2), 41–61 (2007). (in Russian)
Glebov, A.N., Gordeeva, A.V., Zambalaeva, D.Zh.: An algorithm with approximation ratio 7/5 for the minimum two peripatetic salesmen problem with different weight functions. Sib. Electron. Math. Izv. 8, 296–309 (2011). (in Russian)
Glebov, A.N., Zambalaeva, D.Zh.: A polynomial algorithm with approximation ratio 7/9 for the maximum two peripatetic salesmen problem. Diskretn. Anal. Issled. Oper. 18(4), 17–48 (2011). (in Russian)
Glebov, A.N., Zambalaeva, D.Zh.: An approximation algorithm for the minimum two peripatetic salesmen problem with different weight functions. Diskretn. Anal. Issled. Oper. 18(5), 11–37 (2011). (in Russian)
Gordeeva, A.V.: Polynomial algorithms with performance garauntees for the metric maximization version of the 2-PSP. Specialist’s Thesis, 22 p. Novosibirsk State University, Novosibirsk (2010). (in Russian)
Kostochka, A.V., Serdyukov, A.I.: Polynomial algorithms with approximation ratios \(3/4\) and \(5/6\) for the maximization version of the TSP. Upravlyaemye Systemy. Sobolev Institute of Mathematics, Novosiirsk, vol. 26, pp. 55–59 (1985). (in Russian)
Kowalik, L., Mucha, M.: Deterministic 7/8-approximation for the metric maximum TSP. Theor. Comput. Sci. 410(47–49), 5000–5009 (2009)
Krarup, J.: The peripatetic salesman and some related unsolved problems. In: Combinatorial Programming: Methods and Applications (Proceedings of NATO Advanced Study Inst., Versailles, 1974), pp. 173–178. Reidel, Dordrecht (1975)
Serdyukov, A.I.: On some extremal tours in graphs. Upravlyaemye Systemy. Sobolev Institute of Mathematics, Novosiirsk, vol. 17, pp. 76–79 (1984). (in Russian)
Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations, 830 p. Kluver Academic Publishers, Dordrecht (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Glebov, A.N., Gordeeva, A.V. (2016). An Algorithm with Approximation Ratio 5/6 for the Metric Maximum m-PSP. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. DOOR 2016. Lecture Notes in Computer Science(), vol 9869. Springer, Cham. https://doi.org/10.1007/978-3-319-44914-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-44914-2_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44913-5
Online ISBN: 978-3-319-44914-2
eBook Packages: Computer ScienceComputer Science (R0)