Abstract
We study the m-Peripatetic Salesman Problem on random inputs. In earlier papers we proposed a polynomial asymptotically optimal algorithm for the m-PSP with different weight functions on random inputs. The probabilistic analysis carried out for that algorithm is not suitable in the case of the m-PSP with identical weight functions.
In this paper we present an approach which under certain conditions gives polynomial asymptotically optimal algorithms for the m-PSP on random inputs with identical weight functions and for the m-PSP with different weight functions, as well. We describe in detail the cases of uniform and shifted exponential distributions of random inputs.
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.K.: A 3/4 approximation algorithms for finding two disjoint Hamiltonian cycles of maximum weight. J. Appl. Ind. Math. 1(2), 142–147 (2007)
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)
Angluin, D., Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Syst. Sci. 18(2), 155–193 (1979)
Baburin, A.E., Gimadi, E.K.: On the asymptotic optimality of an algorithm for solving the maximum m-PSP in a multidimensional Euclidean space. Proc. Steklov Inst. Math. 272(1), 1–13 (2011)
Baburin, A.E., Gimadi, E.K., Korkishko, N.M.: Approximation algorithms for finding two edge-disjoint Hamiltonian cycles of minimal total weight (in Russian). J. Discr. Anal. Oper. Res. 2(11), 11–25 (2004)
Bollobas, B., Fenner, T.I., Frieze, A.M.: An algorithm for finding Hamilton paths and cycles in random graphs. Combinatorica 7, 327–341 (1987)
Chebolu, P., Frieze, A.M., Melsted, P.: Finding a maximum matching in a sparse random graph in O(n) expected time. JACM 57, 24 (2010)
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 and lower bounds for the symmetric K-Peripatetic Salesman Problem. Optimization 23(4), 357–367 (1992)
DeKort, J.B.J.M.: Lower bounds for symmetric K-peripatetic salesman problems. Optimization 22(1), 113–122 (1991)
De Kort, J.B.J.M.: A branch and bound algorithm for symmetric 2-peripatetic salesman problems. Eur. J. Oper. Res. 70, 229–243 (1993)
Erdos, P., Renyi, A.: On random graphs I. Publ. Math. Debrecen 6, 290–297 (1959)
Frieze, A., Haber, S.: An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three. J. Random Struct. Algorithms 47(1), 73–98 (2015)
Gimadi, E.K., Glazkov, Y.V., Glebov, A.N.: Approximation algorithms for sollving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2. J. Appl. Ind. Math. 3(1), 46–60 (2009)
Gimadi, E.K., Glazkov, Y.V., Tsidulko, O.Y.: The probabilistic analysis of an algorithm for solving the m-planar 3-dimensional assignment problem on one-cycle permutations. J. Appl. Ind. Math. 8(2), 208–217 (2014)
Gimadi, E.K., Glebov, A.N., Skretneva, A.A., Tsidulko, O.Y., Zambalaeva, D.Z.: Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph. Discrete Appl. Math. 196(11), 54–61 (2015)
Gimadi, E.K., Istomin, A.M., Rykov, I.A., Tsidulko, O.Y.: Probabilistic analysis of an approximation algorithm for the m-peripatetic salesman problem on random instances unbounded from above. Proc. Steklov Inst. Math. 289(1), 77–87 (2015)
Gimadi, E.K., Ivonina, E.V.: Approximation algorithms for the maximum 2-peripatetic salesman problem. J. Appl. Ind. Math. 6(3), 295–305 (2012)
Gimadi, E.K., Perepelitsa, V.A.: A statistically effective algorithm for the selection of a Hamiltonian contour or cycle (in Russian). J. Diskret. Anal. 22, 15–28 (1973)
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(1), 69–89 (2012)
Glebov, A.N., Zambalaeva, D.Z.: An approximation algorithm for the minimum two peripatetic salesmen problem with different weight functions. J. Appl. Ind. Math. 6(2), 167–183 (2012)
Komlos, J., Szemeredi, E.: Limit distributions for the existence of Hamilton circuits in a random graph. Discrete Math. 43, 5563 (1983)
Korshunov, A.D.: On the power of some classes of graphs. Sov. Math. Dokl. 11, 1100–1104 (1970)
Krarup, J.: The peripatetic salesman and some related unsolved problems. In: Roy, B. (ed.) Combinatorial Programming, Methods and Applications. NATO Advanced Study Institutes Series, vol. 19, pp. 173–178. Reidel, Dordrecht (1975)
Petrov, V.V.: Limit Theorems of Probability Theory. Sequences of Independent Random Variables. Clarendon Press, Oxford (1995)
Acknowledgments
The authors are supported by the RSCF grant 16-11-10041.
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
Gimadi, E.K., Istomin, A.M., Tsidulko, O.Y. (2016). On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-44914-2_11
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)