Publisher
Springer International Publishing
Reference24 articles.
1. Lecture Notes in Mathematics;Jin Akiyama,2011
2. Arkin, E.M., Chiang, Y., Mitchell, J.S.B., Skiena, S.S., Yang, T.: On the maximum scatter TSP. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1997, pp. 211–220 (1997)
3. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
4. Bartal, Y., Gottlieb, L.-A., Krauthgamer, R.: The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC 2012, pp. 663–672 (2012)
5. Baburin, A.E., Gimadi, E.K.: Certain generalization of the maximum traveling salesman problem. J. Appl. Ind. Math. 1(4), 418–423 (2007)