{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:08:54Z","timestamp":1762272534167,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/cdc40024.2019.9030031","type":"proceedings-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T04:43:11Z","timestamp":1584074591000},"page":"3383-3390","source":"Crossref","is-referenced-by-count":3,"title":["A Submodular Optimization Approach to the Metric Traveling Salesman Problem with Neighborhoods"],"prefix":"10.1109","author":[{"given":"Andrew","family":"Clark","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"196","article-title":"Beyond Steiner’s problem: A VLSI oriented generalization","author":"reich","year":"1989","journal-title":"International Workshop on Graph-Theoretic Concepts in Computer Science"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907641"},{"key":"ref12","first-page":"360","article-title":"Approximation algorithms for geometric tour and network design problems","author":"mata","year":"1995","journal-title":"Symposium on Computational Geometry"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.67"},{"key":"ref14","first-page":"469","article-title":"A fast approximation algorithm for TSP with neighborhoods","volume":"6","author":"gudmundsson","year":"1999","journal-title":"Nordic Journal of Computing"},{"key":"ref15","first-page":"11","article-title":"A PTAS for TSP with neighborhoods among fat regions in the plane","author":"mitchell","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3158232"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00047-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2818310"},{"key":"ref3","article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"christofides","year":"1976","journal-title":"Carnegie-mellon univ pittsburgh pa management sciences research group Tech Rep"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.32"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120103"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90008-6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1993.11732212"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54891-2_8"},{"key":"ref1","volume":"3","author":"lawler","year":"1985","journal-title":"The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2850418"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72870-2_29"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-014-9591-3"},{"key":"ref24","volume":"3","author":"oxley","year":"2006","journal-title":"Matroid Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.04.023"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref25"}],"event":{"name":"2019 IEEE 58th Conference on Decision and Control (CDC)","start":{"date-parts":[[2019,12,11]]},"location":"Nice, France","end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE 58th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8977134\/9028853\/09030031.pdf?arnumber=9030031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:19:42Z","timestamp":1658261982000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9030031\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cdc40024.2019.9030031","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}