{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:41Z","timestamp":1725493661156},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_47","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T04:04:43Z","timestamp":1193457883000},"page":"467-474","source":"Crossref","is-referenced-by-count":1,"title":["Covering a Set of Points with a Minimum Number of Turns"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Collins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"47_CR1","unstructured":"E. Arkin, M. A. Bender, E. Demaine, S. P. Fekete, J. S. B. Mitchell, and S. Sethia, \u201cOptimal Covering Tours with Turn Costs\u201d, Proceedings of the 12th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 138\u2013147, 2001"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(98)00178-1","volume":"68","author":"M. Collins","year":"1998","unstructured":"M. Collins and B. Moret, \u201cImproved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids\u201d, Information Processing Letters\n                           68 (1998), pp. 317\u2013319","journal-title":"Information Processing Letters"},{"key":"47_CR3","volume-title":"AMPL: A Modeling Language for Mathematical Programming","author":"R. Fourer","year":"1993","unstructured":"R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, Boyd and Fraser, Danvers, MA, 1993"},{"key":"47_CR4","first-page":"177","volume":"38","author":"E. Kranakis","year":"1994","unstructured":"E. Kranakis, D. Krizanc, and L. Meertens, \u201cLink Length of Rectilinear Hamiltonian Tours on Grids\u201d, Ars Combinatoria\n                           38 (1994), p. 177.","journal-title":"Ars Combinatoria"},{"key":"47_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/3-540-45535-3_32","volume-title":"Proceedings of IPCO 2001","author":"C. Stein","year":"2001","unstructured":"C. Stein and D. P. Wagner, \u201cApproximation Algorithms for the Minimum Bends Traveling Salesman Problem\u201d, Proceedings of IPCO 2001, LNCS 2081, p. 406"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T10:52:05Z","timestamp":1551005525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_47","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}