{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T14:40:34Z","timestamp":1740926434880,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190933"},{"type":"electronic","value":"9783642190940"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19094-0_12","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T06:21:40Z","timestamp":1297318900000},"page":"98-109","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point"],"prefix":"10.1007","author":[{"given":"Aritra","family":"Banik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhaswar B.","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Agarwal, P.K., Sharir, M., Toledo, S.: An efficient multi-dimensional searching technique and its applications, Technical Report CS-1993-20, Department of Computer Science, Duke University (1993)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bespamyatnikh, S., Bhattacharya, B., Kirkpatrick, D., Segal, M.: Mobile facility location. In: Proceedings of the International ACM Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, vol.\u00a04, pp. 46\u201353 (2000)","DOI":"10.1145\/345848.345858"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11036-006-4470-z","volume":"11","author":"S. Bereg","year":"2006","unstructured":"Bereg, S., Bhattacharya, B., Kirkpatrick, D., Segal, M.: Competitive algorithms for mobile centers. Mobile Networks and Applications\u00a011(2), 177\u2013186 (2006)","journal-title":"Mobile Networks and Applications"},{"key":"12_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (1997)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B. Chazelle","year":"1996","unstructured":"Chazelle, B., Matou\u0161ek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimensions. Journal of Algorithms\u00a021, 579\u2013597 (1996)","journal-title":"Journal of Algorithms"},{"key":"12_CR6","unstructured":"Durocher, S.: Geometric Facility Location under Continuous Motion: Bounded-Velocity Approximations to the Mobile Euclidean k-Centre and k-Median Problems, Ph. D. Thesis, University of British Columbia, Canada (2006)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"4","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $\\mathbb R^3$ and related problems. SIAM Journal on Computing\u00a04, 759\u2013776 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR8","first-page":"79","volume":"1","author":"J.J. Sylvester","year":"1857","unstructured":"Sylvester, J.J.: A question in the geometry of situation. Quarterly Journal of Mathematics\u00a01, 79 (1857)","journal-title":"Quarterly Journal of Mathematics"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E. Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H. (ed.) New Results and New Trends in Computer Science. LNCS, vol.\u00a0555, pp. 359\u2013370. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19094-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T13:43:24Z","timestamp":1740923004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19094-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190933","9783642190940"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19094-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}