{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T20:15:03Z","timestamp":1758399303379,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_31","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"351-360","source":"Crossref","is-referenced-by-count":3,"title":["Touring Disjoint Polygons Problem Is NP-Hard"],"prefix":"10.1007","author":[{"given":"Arash","family":"Ahadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amirhossein","family":"Mozafari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Zarei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.H.: New lower bound techniques for robot motion planning problems. In: Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., pp. 49\u201360 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02574671","volume":"6","author":"W. Chin","year":"1991","unstructured":"Chin, W., Ntafos, S.: Shortest Watchman Routes in Simple Polygons. Discrete and Computational Geometry\u00a06(1), 9\u201331 (1991)","journal-title":"Discrete and Computational Geometry"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Dror, M., Efrat, A., Lubiw, A., Mitchell, J.: Touring a sequence of polygons. In: STOC 2003, pp. 473\u2013482 (2003)","DOI":"10.1145\/780542.780612"},{"key":"31_CR4","first-page":"271","volume":"31","author":"M. Dror","year":"1999","unstructured":"Dror, M.: Polygon plate-cutting with a given order. IIE Transactions\u00a031, 271\u2013274 (1999)","journal-title":"IIE Transactions"},{"key":"31_CR5","unstructured":"Hershberger, J., Snoeyink, J.: An efficient solution to the zookeeper\u2019s problem. In: Proc. 6th Canadian Conf. on Comp. Geometry, pp. 104\u2013109 (1994)"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Li, F., Klette, R.: Rubberband algorithms for solving various 2D or 3D shortest path problems. In: Proc. Computing: Theory and Applications, The Indian Statistical Institute, The Indian Statistical Institute, Kolkata, pp. 9\u201318. IEEE (2007)","DOI":"10.1109\/ICCTA.2007.113"},{"key":"31_CR7","unstructured":"Li, F., Klette, R.: Approximate Algorithms for Touring a Sequence of Polygons. MI-tech TR-24, The University of Auckland, Auckland (2008), \n                    \n                      http:\/\/www.mi.auckland.ac.nz\/tech-reports\/MItech-TR-24.pdf"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-57568-5_236","volume-title":"Algorithms and Computation","author":"X. Tan","year":"1993","unstructured":"Tan, X., Hirata, T.: Constructing Shortest Watchman Routes by Divide and Conquer. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 68\u201377. Springer, Heidelberg (1993)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-58325-4_219","volume-title":"Algorithms and Computation","author":"X. Tan","year":"1994","unstructured":"Tan, X., Hirata, T.: Shortest safari routes in simple polygons. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 523\u2013531. Springer, Heidelberg (1994)"},{"key":"31_CR10","unstructured":"Pan, X., Li, F., Klette, R.: Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons. In: Proc. Canadian Conf. Computational Geometry, Winnipeg, Canada, pp. 175\u2013178 (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:48:55Z","timestamp":1558687735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}