{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:18Z","timestamp":1725558798052},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_30","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"264-277","source":"Crossref","is-referenced-by-count":0,"title":["The Rectilinear k-Bends TSP"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Estivill-Castro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Apichat","family":"Heednacram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis","family":"Suraweera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/S0097539703434267","volume":"35","author":"E. Arkin","year":"2005","unstructured":"Arkin, E., Bender, M., Demaine, E., Fekete, S., Mitchell, J., Sethia, S.: Optimal covering tours with turn costs. SIAM Journal of Computing\u00a035(3), 531\u2013566 (2005)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"30_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0020-0190(02)00502-1","volume":"86","author":"E. Arkin","year":"2003","unstructured":"Arkin, E., Mitchell, J., Piatko, C.: Minimum-link watchman tours. Information Processing Letters\u00a086(4), 203\u2013207 (2003)","journal-title":"Information Processing Letters"},{"key":"30_CR3","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 and Computational Geometry\u00a041, 513\u2013532 (2009)","journal-title":"Discrete and Computational Geometry"},{"issue":"1-2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1142\/S021819590400138X","volume":"14","author":"M. Collins","year":"2004","unstructured":"Collins, M.: Covering a set of points with a minimum number of turns. Int. J. Comput. Geometry Appl.\u00a014(1-2), 105\u2013114 (2004)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"3","key":"30_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1142\/S0218195992000172","volume":"2","author":"M. Berg de","year":"1992","unstructured":"de Berg, M., van Kreveld, M., Nilsson, B., Overmars, M.: Shortest path queries in rectilinear worlds. Int. J. Comput. Geometry Appl.\u00a02(3), 287\u2013309 (1992)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"30_CR6","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"30_CR7","series-title":"Texts in Theoretical Computer Science","volume-title":"Parameterized Complexity Theory.","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, Berlin (2006)"},{"issue":"1","key":"30_CR8","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(1), 29\u201342 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/98524.98595","volume-title":"6th ACM Symp. on Comput. Geometry (SCG \u201990)","author":"D. Lee","year":"1990","unstructured":"Lee, D., Chen, T., Yang, C.: Shortest rectilinear paths among weighted obstacles. In: 6th ACM Symp. on Comput. Geometry (SCG \u201990), pp. 301\u2013310. ACM, NY (1990)"},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(96)80467-7","volume":"70","author":"D. Lee","year":"1996","unstructured":"Lee, D., Yang, C., Wong, C.: Rectilinear paths among rectilinear obstacles. Discrete Applied Mathematics\u00a070(3), 185\u2013215 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR11","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, New York (2006)"},{"key":"30_CR12","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.: Approximation algorithms for the minimum bends traveling salesman problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 406\u2013422. Springer, Heidelberg (2001)"},{"issue":"5","key":"30_CR13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.comgeo.2008.04.006","volume":"42","author":"D. Wagner","year":"2009","unstructured":"Wagner, D., Drysdale, R., Stein, C.: An \n                    \n                      \n                    \n                    ${O}(n^{\\mbox{5\/2}}\\log n)$\n                   algorithm for the rectilinear minimum link-distance problem in three dimensions. Comput. Geom. Theory Appl.\u00a042(5), 376\u2013387 (2009)","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:27Z","timestamp":1619784987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}