{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:58Z","timestamp":1725677638635},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_6","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T08:25:56Z","timestamp":1335601556000},"page":"58-69","source":"Crossref","is-referenced-by-count":4,"title":["On Covering Points with Minimum Turns"],"prefix":"10.1007","author":[{"given":"Minghui","family":"Jiang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S0097539796312721","volume":"29","author":"A. Aggarwal","year":"1999","unstructured":"Aggarwal, A., Coppersmith, D., Khanna, S., Motwani, R., Schieber, B.: The angular-metric traveling salesman problem. SIAM Journal on Computing\u00a029, 697\u2013711 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0020-0190(02)00502-1","volume":"86","author":"E.M. Arkin","year":"2003","unstructured":"Arkin, E.M., Mitchell, J.S.B., Piatko, C.D.: Minimum-link watchman tours. Information Processing Letters\u00a086, 203\u2013207 (2003)","journal-title":"Information Processing Letters"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/S0097539703434267","volume":"35","author":"E.M. Arkin","year":"2005","unstructured":"Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. SIAM Journal on Computing\u00a035, 531\u2013566 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00454-008-9127-1","volume":"41","author":"S. Bereg","year":"2009","unstructured":"Bereg, S., Bose, P., Dumitrescu, A., Hurtado, F., Valtr, P.: Traversing a set of points with a minimum number of turns. Discrete & Computational Geometry\u00a041, 513\u2013532 (2009)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1142\/S021819590400138X","volume":"14","author":"M.J. Collins","year":"2004","unstructured":"Collins, M.J.: Covering a set of points with a minimum number of turns. International Journal of Computational Geometry and Applications\u00a014, 105\u2013114 (2004)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(98)00178-1","volume":"68","author":"M.J. Collins","year":"1998","unstructured":"Collins, M.J., Moret, B.M.E.: Improved lower bounds for the link length of rectilinear spanning paths in grids. Information Processing Letters\u00a068, 317\u2013319 (1998)","journal-title":"Information Processing Letters"},{"key":"6_CR7","first-page":"622","volume":"15","author":"V. Estivill-Castro","year":"2010","unstructured":"Estivill-Castro, V., Heednacram, A., Suraweera, F.: NP-completeness and FPT results for rectilinear covering problems. Journal of Universal Computer Science\u00a015, 622\u2013652 (2010)","journal-title":"Journal of Universal Computer Science"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1142\/S0218195911003615","volume":"21","author":"V. Estivill-Castro","year":"2011","unstructured":"Estivill-Castro, V., Heednacram, A., Suraweera, F.: FPT-algorithms for minimum-bends tours. International Journal of Computational Geometry\u00a021, 189\u2013213 (2011)","journal-title":"International Journal of Computational Geometry"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0925-7721(96)00012-0","volume":"8","author":"S.P. Fekete","year":"1997","unstructured":"Fekete, S.P., Woeginger, G.J.: Angle-restricted tours in the plane. Computational Geometry: Theory and Applications\u00a08, 195\u2013218 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"6_CR10","unstructured":"Gaur, D.R., Bhattacharya, B.: Covering points by axis parallel lines. In: Proceedings of the 23rd European Workshop on Computational Geometry, pp. 42\u201345 (2007)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Grantson, M., Levcopoulos, C.: Covering a set of points with a minimum number of lines. In: Proceedings of the 22nd European Workshop on Computational Geometry, pp. 145\u2013148 (2006)","DOI":"10.1007\/11758471_4"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics\u00a030, 29\u201342 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A. Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamiltonian paths in grid graphs. SIAM Journal on Computing\u00a011, 676\u2013686 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00454-004-1108-4","volume":"33","author":"S. Langerman","year":"2005","unstructured":"Langerman, S., Morin, P.: Covering things with things. Discrete & Computational Geometry\u00a033, 717\u2013729 (2005)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR15","first-page":"177","volume":"38","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., Meertens, L.: Link length of rectilinear Hamiltonian tours in grids. Ars Combinatoria\u00a038, 177\u2013192 (1994)","journal-title":"Ars Combinatoria"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0167-6377(82)90039-6","volume":"1","author":"N. Megiddo","year":"1982","unstructured":"Megiddo, N., Tamir, A.: On the complexity of locating linear facilities in the plane. Operations Research Letters\u00a01, 194\u2013197 (1982)","journal-title":"Operations Research Letters"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/3-540-45535-3_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"C. Stein","year":"2001","unstructured":"Stein, C., Wagner, D.P.: Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 406\u2013421. Springer, Heidelberg (2001)"},{"key":"6_CR18","unstructured":"Wagner, D.P.: Path Planning Algorithms under the Link-Distance Metric. Ph.D. thesis, Dartmouth College (2006)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"4005","DOI":"10.1016\/j.tcs.2010.08.012","volume":"411","author":"J. Wang","year":"2010","unstructured":"Wang, J., Li, W., Chen, J.: A parameterized algorithm for the hyperplane-cover problem. Theoretical Computer Science\u00a0411, 4005\u20134009 (2010)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:34:51Z","timestamp":1558298091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}