{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:40:02Z","timestamp":1746160802639,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_8","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"84-95","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Algorithms for Constrained 1-Center Problems"],"prefix":"10.1007","author":[{"given":"Luis","family":"Barba","sequence":"first","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","first-page":"39","volume-title":"Proceedings of STOC","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal, A., Guibas, L., Saxe, J., Shor, P.: A linear time algorithm for computing the Voronoi diagram of a convex polygon. In: Proceedings of STOC, pp. 39\u201345. ACM, New York (1987)"},{"key":"8_CR2","first-page":"80","volume-title":"Proceedings of STOC","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of STOC, pp. 80\u201386. ACM, New York (1983)"},{"unstructured":"Bose, P., Langerman, S., Roy, S.: Smallest enclosing circle centered on a query line segment. In: Proceedings of CCCG, pp. 167\u2013170 (2008)","key":"8_CR3"},{"doi-asserted-by":"crossref","unstructured":"Bose, P., Toussaint, G.: Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications. In: Proceedings of CGI, pp. 102\u2013111 (1996)","key":"8_CR4","DOI":"10.1109\/CGI.1996.511792"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-45995-2_18","volume-title":"LATIN 2002: Theoretical Informatics","author":"P. Bose","year":"2002","unstructured":"Bose, P., Wang, Q.: Facility location constrained to a polygonal domain. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 153\u2013164. Springer, Heidelberg (2002)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/PL00009478","volume":"22","author":"T.M. Chan","year":"1999","unstructured":"Chan, T.M.: Geometric applications of a randomized optimization technique. Discrete and Computational Geometry\u00a022, 547\u2013567 (1999)","journal-title":"Discrete and Computational Geometry"},{"key":"8_CR7","first-page":"183","volume":"10","author":"B. Chazelle","year":"1993","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M.: Diameter, width, closest line pair, and parametric searching. DCG\u00a010, 183\u2013196 (1993)","journal-title":"DCG"},{"key":"8_CR8","first-page":"17","volume":"15","author":"F. Hurtado","year":"2000","unstructured":"Hurtado, F., Sacristan, V., Toussaint, G.: Some constrained minimax and maximim location problems. Studies in Locational Analysis\u00a015, 17\u201335 (2000)","journal-title":"Studies in Locational Analysis"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/BF01937271","volume":"27","author":"B. Joe","year":"1987","unstructured":"Joe, B., Simpson, R.B.: Corrections to Lee\u2019s visibility polygon algorithm. BIT Numerical Mathematics\u00a027, 458\u2013473 (1987)","journal-title":"BIT Numerical Mathematics"},{"unstructured":"Lee, D.T.: Farthest neighbor Voronoi diagrams and applications. Report 80-11-FC-04, Dept. Elect. Engrg. Comput. Sci. (1980)","key":"8_CR10"},{"issue":"2","key":"8_CR11","first-page":"87","volume":"12","author":"D.T. Lee","year":"1983","unstructured":"Lee, D.T.: On finding the convex hull of a simple polygon. International Journal of Parallel Programming\u00a012(2), 87\u201398 (1983)","journal-title":"International Journal of Parallel Programming"},{"key":"8_CR12","first-page":"221","volume":"6","author":"J. Matousek","year":"1991","unstructured":"Matousek, J.: Computing the center of planar point sets. Discrete and Computational Geometry\u00a06, 221 (1991)","journal-title":"Discrete and Computational Geometry"},{"key":"8_CR13","first-page":"1","volume-title":"Proceedings of SCG","author":"J. Matou\u0161ek","year":"1989","unstructured":"Matou\u0161ek, J.: Construction of epsilon nets. In: Proceedings of SCG, pp. 1\u201310. ACM, New York (1989)"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in \u211d3 and related problems. SIAM J. Comput.\u00a012(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"unstructured":"Preparata, F.: Minimum spanning circle. In: Preparata, F.P. (ed.) Steps in Computational Geometry. University of Illinois (1977)","key":"8_CR15"},{"key":"8_CR16","first-page":"151","volume-title":"Proceedings of FOCS","author":"M. Shamos","year":"1975","unstructured":"Shamos, M., Hoey, D.: Closest-point problems. In: Proceedings of FOCS, pp. 151\u2013162. IEEE Computer Society, Washington, DC (1975)"},{"unstructured":"Sylvester, J.J.: A Question in the Geometry of Situation. Quarterly Journal of Pure and Applied Mathematics\u00a01 (1857)","key":"8_CR17"},{"key":"8_CR18","first-page":"615","volume-title":"Proceedings of STOC","author":"A.C.-C. Yao","year":"1994","unstructured":"Yao, A.C.-C.: Decision tree complexity and Betti numbers. In: Proceedings of STOC, pp. 615\u2013624. ACM, New York (1994)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:23:14Z","timestamp":1746159794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}