{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:24:08Z","timestamp":1648632248421},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1016\/j.ipl.2006.06.005","type":"journal-article","created":{"date-parts":[[2006,7,19]],"date-time":"2006-07-19T10:29:07Z","timestamp":1153304947000},"page":"183-187","source":"Crossref","is-referenced-by-count":2,"title":["A 2-approximation algorithm for the zookeeper's problem"],"prefix":"10.1016","volume":"100","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2006.06.005_bib001","first-page":"63","article-title":"An O(nlogn) algorithm for the zookeeper's problem","volume":"6","author":"Bespamyatnikh","year":"2002","journal-title":"Comput. Geom."},{"key":"10.1016\/j.ipl.2006.06.005_bib002","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.ipl.2006.06.005_bib003","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02574671","article-title":"Shortest watchman routes in simple polygons","volume":"6","author":"Chin","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.ipl.2006.06.005_bib004","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0020-0255(92)90072-G","article-title":"The zookeeper route problem","volume":"63","author":"Chin","year":"1992","journal-title":"Inform. Sci."},{"key":"10.1016\/j.ipl.2006.06.005_bib005","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for visibility and shortest path problems inside simple triangulated polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/j.ipl.2006.06.005_bib006","unstructured":"J. Hershberger, J. Snoeyink, An efficient solution to the zookeeper's problem, in: Proc. of the 6th Canadian Conf. on Comput. Geom., 1994, pp. 104\u2013109"},{"key":"10.1016\/j.ipl.2006.06.005_bib007","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0020-0190(03)00348-X","article-title":"An approximative solution to the zookeeper's problem","volume":"87","author":"Jonsson","year":"2003","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.ipl.2006.06.005_bib008","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0020-0190(00)00144-7","article-title":"Shortest zookeeper's routes in simple polygons","volume":"77","author":"Tan","year":"2001","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.ipl.2006.06.005_bib009","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0020-0190(00)00146-0","article-title":"Fast computation of shortest watchman routes in simple polygons","volume":"77","author":"Tan","year":"2001","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.ipl.2006.06.005_bib010","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0020-0190(03)00284-9","article-title":"Finding shortest safari routes in simple polygons","volume":"87","author":"Tan","year":"2003","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.ipl.2006.06.005_bib011","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0166-218X(03)00451-7","article-title":"Approximation algorithms for the watchman route and zookeeper's problems","volume":"136","author":"Tan","year":"2004","journal-title":"Discrete Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019006001967?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019006001967?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T20:52:49Z","timestamp":1547499169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019006001967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["S0020019006001967"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2006.06.005","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}