{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:45:40Z","timestamp":1742989540558,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030110260"},{"type":"electronic","value":"9783030110277"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-11027-7_27","type":"book-chapter","created":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T21:33:52Z","timestamp":1546205632000},"page":"283-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Edward Kh.","family":"Gimadi","sequence":"first","affiliation":[]},{"given":"Oxana Yu.","family":"Tsidulko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"27_CR1","first-page":"585","volume-title":"Combinatorial Optimization","author":"Alexander Barvinok","year":"2007","unstructured":"Barvinok, A.I., Gimadi, E.Kh., Serdyukov, A.I.: The maximum TSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, pp. 585\u2013608. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"5","key":"27_CR2","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1145\/876638.876640","volume":"50","author":"A Barvinok","year":"2003","unstructured":"Barvinok, A., Fekete, S.P., Johnson, D.S., Tamir, A., Woeginger, G.J., Woodroofe, R.: The geometric maximum traveling salesman problem. J. ACM 50(5), 641\u2013664 (2003)","journal-title":"J. ACM"},{"issue":"S1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1134\/S0081543811020015","volume":"272","author":"A. E. Baburin","year":"2011","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(1), 1\u201313 (2011)","journal-title":"Proceedings of the Steklov Institute of Mathematics"},{"key":"27_CR4","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, Boston, USA, 25\u201327 April 1983, pp. 448\u2013456. ACM, New York (1983)"},{"key":"27_CR5","unstructured":"Gimadi, E.Kh.: A new version of the asymptotically optimal algorithm for solving the Euclidean maximum traveling salesman problem. In: Proceedings of the 12th Baykal International Conference 2001, Irkutsk, vol. 1, pp. 117\u2013123 (2001). (in Russian)"},{"issue":"S2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1134\/S0081543808060072","volume":"263","author":"E. Kh. Gimadi","year":"2008","unstructured":"Gimadi, E.Kh.: Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space. Proc. Steklov Inst. Math. 263(2), 56\u201367 (2008)","journal-title":"Proceedings of the Steklov Institute of Mathematics"},{"volume-title":"The Traveling Salesman Problem and ITS Variations","year":"2002","key":"27_CR7","unstructured":"Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and ITS Variations. Kluver Academic Publishers, Dordrecht\/Boston\/London (2002)"},{"issue":"3","key":"27_CR8","first-page":"9","volume":"1","author":"O Johnson","year":"2006","unstructured":"Johnson, O., Liu, J.: A traveling salesman approach for predicting protein functions. Source Code Biol. Med. 1(3), 9\u201316 (2006)","journal-title":"Source Code Biol. Med."},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1082036.1082041","volume":"52","author":"H Kaplan","year":"2005","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4), 602\u2013626 (2005)","journal-title":"J. ACM"},{"volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985","key":"27_CR10","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)"},{"issue":"5","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1007\/s12038-007-0101-5","volume":"32","author":"SS Ray","year":"2007","unstructured":"Ray, S.S., Bandyopadhyay, S., Pal, S.K.: Gene ordering in partitive clustering using microarray expressions. J. Biosci. 32(5), 1019\u20131025 (2007)","journal-title":"J. Biosci."},{"key":"27_CR12","unstructured":"Serdyukov, A.I.: An asymptotically optimal algorithm for the maximum traveling salesman problem in Euclidean space. Upravlyaemye sistemy, Novosibirsk, vol. 27, pp. 79\u201387 (1987). (in Russian)"},{"issue":"2","key":"27_CR13","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."}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11027-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:40:52Z","timestamp":1710333652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-11027-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030110260","9783030110277"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11027-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 December 2018","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/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":"81","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":"29","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":"0","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":"36% - 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","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":"1.58","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":"107 papers were sent and 26 of these were rejected without reviewing. 1 other paper was accepted due to the interdisciplinary nature of the paper.","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)"}}]}}