{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:38:55Z","timestamp":1743115135850,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030712136"},{"type":"electronic","value":"9783030712143"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-71214-3_21","type":"book-chapter","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T11:04:17Z","timestamp":1616583857000},"page":"257-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Asymptotically Optimal Solvability of Euclidean Max m-k-Cycles Cover Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1349-405X","authenticated-orcid":false,"given":"Edward","family":"Gimadi","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Rykov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,25]]},"reference":[{"key":"21_CR1","unstructured":"Arora, S.: Polynomial-programming: methods and applications. In: Reeves, C.R. (ed.) NATO Advanced Study Institute Series, Series C: Mathematics and Physics Science, vol. 19, pp. 1730\u2013178. Reidel, Dordrecht (1975)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Baburin, A.E., Gimadi, E.Kh.: On the asymptotic optimality of an algorithm for solving the maximum m-PSP in a multidimensional Euclidean space. Proc. Steklov Inst. Math. 272(Suppl. 1), 1\u201313 (2011)","DOI":"10.1134\/S0081543811020015"},{"key":"21_CR3","unstructured":"Christodes, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. In: Symposium on New Directions and Recent Results in Algorithms and Complexity, p. 441. Academic Press, New York (1976)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-restricted subgraph and bidirected network flow problems. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing 1983, Boston, USA, pp. 448\u2013456. ACM, New York (1983)","DOI":"10.1145\/800061.808776"},{"key":"21_CR5","unstructured":"Gimadi, E.Kh.: A new version of the asymptotically optimal algorithm for solving the Euclidean maximum traveling salesman problem. In: Proceeding of the 12th Baykal International Conference 2001, Irkutsk, vol. 1, pp. 117\u2013123 (2009). (in Russian)"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Gimadi, E.Kh., Rykov, I.A.: Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles. Proc. Steklov Inst. Math. 295, 57\u201367 (2016). https:\/\/doi.org\/10.1134\/S0081543816090078","DOI":"10.1134\/S0081543816090078"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Gimadi, E.Kh., Rykov, I.A.: On asymptotical optimality of solving maximum-weight Euclidean m-cycles covering problem. Doklady Math. 93(1\/2), 117\u2013120 (2016)","DOI":"10.1134\/S1064562416010233"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Gimadi, E.Kh., Tsidulko, O.Yu.: Asymptotically optimal algorithm for the maximum m-peripatetic salesman problem in a normed space. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P.M. (eds.) LION 12 2018. LNCS, vol. 11353, pp. 402\u2013410. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05348-2_33","DOI":"10.1007\/978-3-030-05348-2_33"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Gimadi, E.Kh., Rykov, I.A.: On asymptotically optimal solvability of max m-k-cycles cover problem in a normed space. In: Kononov, A., Khachay, M., Kalyagin, V.A., Pardalos, P. (eds.) MOTOR 2020. LNCS, vol. 12095, pp. 85\u201397. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49988-4_6","DOI":"10.1007\/978-3-030-49988-4_6"},{"key":"21_CR10","unstructured":"Khachay, M., Neznakhina, E.: Approximation of Euclidean k-size cycle cover problem. Croatian Oper. Res. Rev. (CRORR) 5, 177\u2013188 (2014)"},{"key":"21_CR11","unstructured":"Khachay, M., Neznakhina, E.: Polynomial-time approximations scheme for a Euclidean problem on a cycle covering of agraph. Trudy instituta matematiki i mehaniki UrORAN 20(4), 297\u2013311 (2014). (in Russian)"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Krarup, J.: The peripatetic salesman and some related unsolved problems. In: Roy, B. (eds.) Combinatorial Programming: Methods and Applications. NATO Advanced Study Institutes Series (Series C \u2013 Mathematical and Physical Sciences), vol. 19, pp. 173\u2013178. Springer, Dordrecht (1975). https:\/\/doi.org\/10.1007\/978-94-011-7557-9_8","DOI":"10.1007\/978-94-011-7557-9_8"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-74839-7_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B Manthey","year":"2007","unstructured":"Manthey, B.: Minimum-weight cycle\u00a0covers and their\u00a0approximability. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 178\u2013189. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74839-7_18"},{"key":"21_CR14","unstructured":"Papadimitriou, C.: Euclidean TSP is NP-complete. Theoret. Comput. Sci. 4, 237\u2013244 (1977)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Sahni, S., Gonzales, T.: P-complete approximation problems. J. ACM 23(3), 555\u2013565 (1976)","DOI":"10.1145\/321958.321975"},{"key":"21_CR16","unstructured":"Serdyukov, A.I.: An asymptotically optimal algorithm for the maximum traveling salesman problem in Euclidean space. Upravlyaemye sistemy, Novosibirsk 27, 79\u201387 (1987). (in Russian)"},{"issue":"2","key":"21_CR17","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.dam.2012.09.007","volume":"163","author":"VV Shenmaier","year":"2014","unstructured":"Shenmaier, V.V.: Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP. Discret. Appl. Math. 163(2), 214\u2013219 (2014)","journal-title":"Discret. Appl. Math."},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Shenmaier, V.V.: An algorithm for the polyhedral cyclic covering problem with restrictions on the number and length of cycles. Tr. IMM UrORAN. 24(3), 272\u2013280 (2018). https:\/\/doi.org\/10.21538\/0134-4889-2018-24-3-272-280","DOI":"10.21538\/0134-4889-2018-24-3-272-280"}],"container-title":["Communications in Computer and Information Science","Recent Trends in Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-71214-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:54:14Z","timestamp":1619225654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-71214-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030712136","9783030712143"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-71214-3_21","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.33","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}