TY - GEN
T1 - On Asymptotically Optimal Solvability of Euclidean Max m-k-Cycles Cover Problem
AU - Gimadi, Edward
AU - Rykov, Ivan
N1 - Funding Information:
The work was supported by the program of fundamental scientific researches of the SB RAS, project No 0314-2019-0014.
Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - We consider the problem of finding m edge-disjoint k-cycles covers formulated in d-dimensional Euclidean space. We construct a polynomial-time approximation algorithm for this problem and derive conditions of its asymptotical optimality.
AB - We consider the problem of finding m edge-disjoint k-cycles covers formulated in d-dimensional Euclidean space. We construct a polynomial-time approximation algorithm for this problem and derive conditions of its asymptotical optimality.
KW - Asymptotically optimal
KW - Cycles covering
KW - m-TSP
UR - http://www.scopus.com/inward/record.url?scp=85107361206&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-71214-3_21
DO - 10.1007/978-3-030-71214-3_21
M3 - Conference contribution
AN - SCOPUS:85107361206
SN - 9783030712136
T3 - Communications in Computer and Information Science
SP - 257
EP - 266
BT - Recent Trends in Analysis of Images, Social Networks and Texts - 9th International Conference, AIST 2020, Revised Supplementary Proceedings
A2 - van der Aalst, Wil M.
A2 - Batagelj, Vladimir
A2 - Buzmakov, Alexey
A2 - Ignatov, Dmitry I.
A2 - Kalenkova, Anna
A2 - Khachay, Michael
A2 - Koltsova, Olessia
A2 - Kutuzov, Andrey
A2 - Kuznetsov, Sergei O.
A2 - Lomazova, Irina A.
A2 - Loukachevitch, Natalia
A2 - Makarov, Ilya
A2 - Napoli, Amedeo
A2 - Panchenko, Alexander
A2 - Pardalos, Panos M.
A2 - Pelillo, Marcello
A2 - Savchenko, Andrey V.
A2 - Tutubalina, Elena
PB - Springer Science and Business Media Deutschland GmbH
T2 - 9th International Conference on Analysis of Images, Social Networks, and Texts, AIST 2020
Y2 - 15 October 2020 through 16 October 2020
ER -