A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP
- 1 Downloads
We present a first polynomial algorithm with guaranteed approximation ratio for the asymmetric maximization version of the asymmetric 3-Peripatetic Salesman Problem (3-APSP). This problem consists in finding the three edge-disjoint Hamiltonian circuits of maximal total weight in a complete weighted digraph. We prove that the algorithm has guaranteed approximation ratio 3/5 and cubic running-time.
KeywordsHamiltonian cycle traveling salesman problem m-peripatetic salesman problem approximation algorithm guaranteed approximation ratio
Unable to display preview. Download preview PDF.
The authors are grateful to the anonymous Reviewer for the careful reading of the manuscript and valuable remarks.
- 1.J. Krarup, “The Peripatetic Salesman and Some Related Unsolved Problems,” in Combinatorial Programming: Methods and Applications (Proceedings of NATO Advance Study Institute, Versailles, France, September 2–13, 1974) (Reidel, Dordrecht, 1975), pp. 173–178.Google Scholar
- 6.A. N. Glebov and A. V. Gordeeva, “An Algorithm with Approximation Ratio 5/6 for the Metric Maximum m-PSP,” in Discrete Optimization and Operations Research (Proceedings of the 9th International Conference DOOR, Vladivostok, Russia, September 19–23, 2016) (Springer, Cham, 1982), pp. 159–170.Google Scholar
- 7.A. E. Baburin and E. Kh. Gimadi, “On the Asymptotic Optimality of an Algorithm for Solving the Maximum m-PSP in a Multidimensional Euclidean Space,” Trudy Inst. Mat. Mekh. Ural. Otdel. Ross. Akad. Nauk 16 (3), 12–24 (2010) [Proc. Steklov Inst. Math. 272 (Suppl. 1), S1–S13 (2011)].Google Scholar
- 8.E. Kh. Gimadi, “Asymptotically Optimal Algorithm for Finding One and Two Edge-Disjoint Traveling Salesman Routes of Maximal Weight in Euclidean Space,” Trudy Inst. Mat. Mekh. Ural. Otdel. Ross. Akad. Nauk 14 (2), 23–32 (2008) [Proc. Steklov Inst. Math. 263 (Suppl. 2), S57–S67 (2008)].MathSciNetzbMATHGoogle Scholar
- 18.E. Kh. Gimadi, “Approximation Efficient Algorithms with Performance Guarantees for some Hard Routing Problems,” in Proceedings of II International Conference “Optimization and Applications” OPTIMA-2011, Petrovac, Montenegro, September 25-October 2, 2011 (Vych. Tsentr Ross. Akad. Nauk, Moscow, 2011), pp. 98–101.Google Scholar
- 22.A. I. Serdyukov, “An Algorithm with an Estimate for the Maximum Traveling Salesman Problem,” in Controlled Systems, Vol. 25 (Inst. Mat. SO AN SSSR, Novosibirsk, 1984), pp. 80–86.Google Scholar
- 24.K. Paluch, M. Mucha, and A. Madry, “A 7/9-Approximation Algorithm for the Maximum Traveling Salesman Problem,” in Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (Proceedings of the 12th International Workshop APPROX-2009 and the 13th International Workshop RANDOM-2009, Berkeley, CA, USA, August 21–23, 2009) (Springer, Heidelberg, 1982), pp. 298–311.Google Scholar
- 25.S. Dudycz, J. Marcinkowski, K. Paluch, and B. A. Rybicki, “4/5-Approximation Algorithm for the Maximum Traveling Salesman Problem”, in Integer Programming and Combinatorial Optimization (Proceedings of 19th International Conference IPCO-2017, Waterloo, ON, Canada, June 26–28, 2017) (Springer, 2017), pp. 173–185.Google Scholar
- 26.H. N. Gabow, “An Efficient Reduction Technique for Degree-Restricted Subgraph and Bidirected Network Flow Problems,” in Proceedings of 15th Annual ACM Symposium on Theory of Computing, Boston, USA, April 25–27, 1983) (ACM, New York, 1983), pp. 448–456.Google Scholar