Standard

Asymptotically optimal algorithm for the maximum M-peripatetic salesman problem in a normed space. / Gimadi, E. Kh; Tsidulko, O. Yu.

Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer-Verlag GmbH and Co. KG, 2019. p. 402-410 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11353 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Gimadi, EK & Tsidulko, OY 2019, Asymptotically optimal algorithm for the maximum M-peripatetic salesman problem in a normed space. in Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11353 LNCS, Springer-Verlag GmbH and Co. KG, pp. 402-410, 12th International Conference on Learning and Intelligent Optimization, LION 12, Kalamata, Greece, 10.06.2018. https://doi.org/10.1007/978-3-030-05348-2_33

APA

Gimadi, E. K., & Tsidulko, O. Y. (2019). Asymptotically optimal algorithm for the maximum M-peripatetic salesman problem in a normed space. In Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers (pp. 402-410). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11353 LNCS). Springer-Verlag GmbH and Co. KG. https://doi.org/10.1007/978-3-030-05348-2_33

Vancouver

Gimadi EK, Tsidulko OY. Asymptotically optimal algorithm for the maximum M-peripatetic salesman problem in a normed space. In Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer-Verlag GmbH and Co. KG. 2019. p. 402-410. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-05348-2_33

Author

Gimadi, E. Kh ; Tsidulko, O. Yu. / Asymptotically optimal algorithm for the maximum M-peripatetic salesman problem in a normed space. Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer-Verlag GmbH and Co. KG, 2019. pp. 402-410 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@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}",
note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 12th International Conference on Learning and Intelligent Optimization, LION 12 ; Conference date: 10-06-2018 Through 15-06-2018",
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",

}

RIS

TY - GEN

T1 - Asymptotically optimal algorithm for the maximum M-peripatetic salesman problem in a normed space

AU - Gimadi, E. Kh

AU - Tsidulko, O. Yu

N1 - Publisher Copyright: © 2019, Springer Nature Switzerland AG.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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).

AB - 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).

KW - Asymptotically optimal algorithm

KW - Maximum m-peripatetic salesman problem

KW - Maximum traveling salesman problem

KW - Normed space

UR - http://www.scopus.com/inward/record.url?scp=85059946305&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-05348-2_33

DO - 10.1007/978-3-030-05348-2_33

M3 - Conference contribution

AN - SCOPUS:85059946305

SN - 9783030053475

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 402

EP - 410

BT - Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers

PB - Springer-Verlag GmbH and Co. KG

T2 - 12th International Conference on Learning and Intelligent Optimization, LION 12

Y2 - 10 June 2018 through 15 June 2018

ER -

ID: 18129296