{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:17Z","timestamp":1725484637554},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45995-2_18","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T22:33:34Z","timestamp":1180478014000},"page":"153-164","source":"Crossref","is-referenced-by-count":8,"title":["Facility Location Constrained to a Polygonal Domain"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Qingda","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"18_CR1","first-page":"37","volume":"15","author":"P. Bose","year":"2000","unstructured":"P. Bose and G. T. Toussaint. Computing the constrained euclidean, geodesic and link centers of a simple polygon with applications. Studies of Location Analysis, Special Issue on Computational Geometry, 15:37\u201366, 2000.","journal-title":"Studies of Location Analysis, Special Issue on Computational Geometry"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM J. Comput., 15:317\u2013340, 1986.","journal-title":"SIAM J. Comput."},{"key":"18_CR3","unstructured":"D. Halperin and C. Linhart. The smallest enclosing disks with obstacles. Manuscript, Dep. of Comp. Science, Tel-Aviv University, Israel, 1999."},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J. Hershberger","year":"1995","unstructured":"J. Hershberger and S. Suri. A pedestrian approach to ray shooting: Shoot a ray, take a walk. Journal of Algorithms, 18(3):403\u2013431, 1995.","journal-title":"Journal of Algorithms"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"D. Halperin, M. Sharir, and K. Goldberg. The 2-center problem with obstacles. In Proc. of the 16th ACM Symp. on Comp. Geom., pages 80\u201390, 2000.","DOI":"10.1145\/336154.336184"},{"key":"18_CR6","first-page":"17","volume":"15","author":"F. Hurtado","year":"2000","unstructured":"F. Hurtado, V. Sacristn, and G. Toussaint. Constrained facility location. Studies of Location Analysis, Special Issue on Computational Geometry, 15:17\u201335, 2000.","journal-title":"Studies of Location Analysis, Special Issue on Computational Geometry"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"D. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12(1):28\u201335, 1983.","journal-title":"SIAM J. Comput."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo. Linear-time algorithms for linear programming in r3 and related problems. SIAM J. Comput., 12:759\u2013776, 1983.","journal-title":"SIAM J. Comput."},{"key":"18_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, 1985."},{"issue":"5","key":"18_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01008046","volume":"12","author":"G. T. Toussaint","year":"1983","unstructured":"G. T. Toussaint. Computing largest empty circles with location constraints. Int. J. of Comp. and Information Science, 12(5):347\u2013358, 1983.","journal-title":"Int. J. of Comp. and Information Science"},{"key":"18_CR11","unstructured":"Q. Wang. Facility Location Constrained to a Simple Polygon. Master\u2019s thesis, Carleton University, 2001."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:30:16Z","timestamp":1556440216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}