{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:48Z","timestamp":1759637568496},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0020-0190(01)00259-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"137-142","source":"Crossref","is-referenced-by-count":12,"title":["The Traveling Salesman Problem for lines in the plane"],"prefix":"10.1016","volume":"82","author":[{"given":"H\u00e5kan","family":"Jonsson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00259-9_BIB001","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(86)90010-6","article-title":"Computing the convex hull of line intersections","volume":"7","author":"Atallah","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00259-9_BIB002","series-title":"Approximating the shortest watchman route in a simple polygon, Technical Report","author":"Carlsson","year":"1997"},{"issue":"3","key":"10.1016\/S0020-0190(01)00259-9_BIB003","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/PL00009467","article-title":"Finding the shortest watchman route in a simple polygon","volume":"22","author":"Carlsson","year":"1999","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10.1016\/S0020-0190(01)00259-9_BIB004","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02574671","article-title":"Shortest watchman routes in simple polygons","volume":"6","author":"Chin","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(01)00259-9_BIB005","series-title":"The Euclidean traveling salesman problem with neighborhoods and a connecting fence, PhD Thesis","author":"Jonsson","year":"2000"},{"key":"10.1016\/S0020-0190(01)00259-9_BIB006","series-title":"The Traveling Salesman Problem","year":"1985"},{"key":"10.1016\/S0020-0190(01)00259-9_BIB007","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","article-title":"An optimal algorithm for finding the kernel of a polygon","volume":"26","author":"Lee","year":"1979","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0020-0190(01)00259-9_BIB008","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00259-9_BIB009","series-title":"Handbook of Discrete and Computational Geometry","first-page":"445","article-title":"Shortest paths and networks","author":"Mitchell","year":"1997"},{"key":"10.1016\/S0020-0190(01)00259-9_BIB010","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The Euclidean traveling salesman problem is NP-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0020-0190(01)00259-9_BIB011","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0020-0190(00)00144-7","article-title":"Shortest zookeeper's routes in simple polygons","volume":"77","author":"Tan","year":"2001","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00259-9_BIB012","doi-asserted-by":"crossref","unstructured":"X.H. Tan, T. Hirata, Y. Inagaki, Corrigendum to \u2018An incremental algorithm for constructing shortest watchman routes\u2019, Manuscript (submitted to Internat. J. Comput. Geom. Appl.), Tokai University, Japan, 1998","DOI":"10.1142\/S0218195999000212"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002599?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002599?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T05:12:08Z","timestamp":1578460328000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002599"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00259-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}