{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:57Z","timestamp":1740169377205,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3472282","type":"journal-article","created":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T18:25:47Z","timestamp":1727893547000},"page":"144509-144518","source":"Crossref","is-referenced-by-count":0,"title":["A 1.5-Approximation for Symmetric Euclidean Open Loop TSP"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8309-3403","authenticated-orcid":false,"given":"Alok","family":"Chauhan","sequence":"first","affiliation":[{"name":"Vellore Institute of Technology, Chennai, Tamil Nadu, India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/access.2024.3366183"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3000236"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/app11010177"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s43069-021-00101-z"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"ref6","first-page":"33","article-title":"A polynomial-time approximation scheme for weighted planar graph TSP","volume-title":"Proc. SODA","volume":"98","author":"Arora"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.93"},{"key":"ref8","article-title":"A systematic review of approximability results for traveling salesman problems leveraging the TSP-T3CO definition scheme","author":"Saller","year":"2023","journal-title":"arXiv:2311.00604"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/access.2022.3233852"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2917838"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2024.e31297"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.06.056"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.07.087"},{"key":"ref14","first-page":"2592","article-title":"Reinforcement learning for route optimization with robustness guarantees","volume-title":"Proc. Int. Joint Conf. Artif. Intel.","volume":"30","author":"Tobias"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.rineng.2023.101745"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0206041"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/20m135594x"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.538"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/mnsc.11.8.B166","article-title":"Three heuristic rules for sequencing fobs to a single production facility","volume":"11","author":"Gavett","year":"1965","journal-title":"Manage. Sci."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-019-01258-y"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539794264585"},{"volume-title":"Co-Existentialism","year":"2024","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s42113-018-0018-0"},{"key":"ref27","first-page":"75","article-title":"Heuristic for symmetric Euclidean TSP with 3\/2-approximation ratio","volume-title":"Proc. ISC","author":"Chauhan"},{"issue":"3","key":"ref28","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02293049","article-title":"Transitions in geometric minimum spanning trees","volume":"8","author":"Monma","year":"1992","journal-title":"Discrete Comput. Geometry"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/335603.335888"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2016-7"},{"key":"ref31","article-title":"Balanced configurations of points in the plane","author":"Pierson","year":"2022","journal-title":"arXiv:2208.02426"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539794264585"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"volume-title":"The Traveling Salesman Problem: A Computational Study","year":"2011","author":"Applegate","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2853129"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2828499"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10702593.pdf?arnumber=10702593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T04:29:39Z","timestamp":1728620979000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10702593\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3472282","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}