@inproceedings{9b5b21c2abd747c3b189573b7b604da0,

title = "Asymptotically optimal algorithm for the maximum M-peripatetic salesman problem in a normed space",

abstract = "The maximum m-Peripatetic Salesman Problem (m-PSP) consists of determining m edge-disjoint Hamiltonian cycles of maximum total weight in a given complete weighted n-vertex graph. We consider a geometric variant of the problem and describe a polynomial time approximation algorithm for the m-PSP in a normed space of fixed dimension. We prove that the algorithm is asymptotically optimal for m = o(n).",

keywords = "Asymptotically optimal algorithm, Maximum m-peripatetic salesman problem, Maximum traveling salesman problem, Normed space",

author = "Gimadi, {E. Kh} and Tsidulko, {O. Yu}",

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-030-05348-2_33",

language = "English",

isbn = "9783030053475",

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 = "402--410",

booktitle = "Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers",

address = "Germany",

note = "12th International Conference on Learning and Intelligent Optimization, LION 12 ; Conference date: 10-06-2018 Through 15-06-2018",

}