{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:57Z","timestamp":1725565257568},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220572"},{"type":"electronic","value":"9783540247678"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24767-8_18","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:45:04Z","timestamp":1284165904000},"page":"168-177","source":"Crossref","is-referenced-by-count":0,"title":["A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes"],"prefix":"10.1007","author":[{"given":"H\u00e5kan","family":"Jonsson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","first-page":"445","volume-title":"Handbook of Discrete and Computational Geometry","author":"J.S.B. Mitchell","year":"1997","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 445\u2013466. CRC Press LLC, Boca Raton (1997)"},{"volume-title":"The Traveling Salesman Problem","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem. Wiley, New York (1985)","key":"18_CR2"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C.H. Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The Euclidean traveling salesman problem is NP-complete. Theoret. Comput. Sci.\u00a04, 237\u2013244 (1977)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Jonsson, H.: The Euclidean Traveling Salesman Problem with Neighborhoods and a Connecting Fence. PhD thesis, Lule\u00e5 University of Technology (2000)","key":"18_CR4"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0255(92)90072-G","volume":"63","author":"W.P. Chin","year":"1992","unstructured":"Chin, W.P., Ntafos, S.: Optimum zookeeper routes. Info. Sci.\u00a063, 245\u2013259 (1992)","journal-title":"Info. Sci."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0020-0190(00)00144-7","volume":"77","author":"X. Tan","year":"2001","unstructured":"Tan, X.: Shortest zookeeper\u2019s routes in simple polygons. Inform. Process. Lett.\u00a077, 23\u201326 (2001)","journal-title":"Inform. Process. Lett."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0020-0190(03)00348-X","volume":"87","author":"H. Jonsson","year":"2003","unstructured":"Jonsson, H.: An approximative solution to the Zookeeper\u2019s Problem. Information Processing Letters\u00a087, 301\u2013307 (2003)","journal-title":"Information Processing Letters"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0166-218X(03)00451-7","volume":"136","author":"X. Tan","year":"2004","unstructured":"Tan, X.: Approximation algorithms for the watchman route and zookeeper\u2019s problems. Discrete Applied Mathematics\u00a0136, 363\u2013376 (2004)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Hershberger, J., Snoeyink, J.: An efficient solution to the zookeeper\u2019s problem. In: Proc. 6th Canad. Conf. Comput. Geom., pp. 104\u2013109 (1994)","key":"18_CR9"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L.J. Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom.\u00a06, 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0925-7721(02)00092-5","volume":"24","author":"S. Bespamyatnikh","year":"2002","unstructured":"Bespamyatnikh, S.: An O(nlogn) algorithm for the Zoo-keeper\u2019s problem. Comput. Geom. Theory Appl.\u00a024, 63\u201374 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci.\u00a039, 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(91)90064-O","volume":"38","author":"J. Hershberger","year":"1991","unstructured":"Hershberger, J.: A new data structure for shortest path queries in a simple polygon. Inform. Process. Lett.\u00a038, 231\u2013235 (1991)","journal-title":"Inform. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Toussaint, G.T.: Special issue on computational geometry. Proceedings of the IEEE, 1347\u20131363 (1992)","key":"18_CR15","DOI":"10.1109\/5.163405"},{"key":"18_CR16","volume-title":"Theories of Light from Descartes to Newton","author":"A.I. Sabra","year":"1967","unstructured":"Sabra, A.I.: Theories of Light from Descartes to Newton. Oldbourne, London (1967)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D.T. Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks\u00a014, 393\u2013410 (1984)","journal-title":"Networks"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01553883","volume":"4","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica\u00a04, 141\u2013155 (1989)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24767-8_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:55:23Z","timestamp":1605761723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24767-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220572","9783540247678"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24767-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}