@inproceedings{0502a9aa7d0f452896336078a1b10b93,
title = "On modification of an asymptotically optimal algorithm for the maximum Euclidean traveling salesman problem",
abstract = "The known asymptotically optimal algorithm for the Euclidean maximum Traveling Salesman Problem by Serdukov builds approximate solution for the problem around the maximum-weight perfect matching. In this paper we are going to discuss an asymptotically optimal algorithm for the Euclidean maximum TSP with running-time O(n3), that uses a maximum weight cycle cover of the initial graph as a foundation for constructing the TSP solution. We also prove a number of structural results for the optima of some maximization problems in normed spaces, which follow from the algorithm.",
keywords = "Asymptotically optimal algorithm, Cycle cover, Euclidean space, Maximum traveling salesman problem, Metric space, Normed space",
author = "Gimadi, {Edward Kh} and Tsidulko, {Oxana Yu}",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-030-11027-7_27",
language = "English",
isbn = "9783030110260",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "283--293",
booktitle = "Analysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers",
address = "Germany",
note = "7th International Conference on Analysis of Images, Social Networks and Texts, AIST 2018 ; Conference date: 05-07-2018 Through 07-07-2018",
}