{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:57:12Z","timestamp":1725638232794},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"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-25591-5_7","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T19:32:34Z","timestamp":1322854354000},"page":"50-59","source":"Crossref","is-referenced-by-count":0,"title":["Covering and Piercing Disks with Two Centers"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Sang-Sub","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"Lena","family":"Schlipf","sequence":"additional","affiliation":[]},{"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"P. Agarwal","year":"2002","unstructured":"Agarwal, P., Procopiuc, C.: Exact and approximation algorithms for clustering. Algorithmica\u00a033(2), 201\u2013226 (2002)","journal-title":"Algorithmica"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1006\/jagm.1994.1038","volume":"17","author":"P.K. Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M., Toledo, S.: Applications of parametric searching in geometric optimization. J. Algorithms\u00a017, 292\u2013318 (1994)","journal-title":"J. Algorithms"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"T.M. Chan","year":"1997","unstructured":"Chan, T.M.: More planar two-center algorithms. Comput. Geom. Theory Appl.\u00a013, 189\u2013198 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1006\/jagm.1997.0914","volume":"27","author":"T.M. Chan","year":"1998","unstructured":"Chan, T.M.: Deterministic algorithms for 2-d convex programming and 3-d online linear programming. J. Algorithms\u00a027(1), 147\u2013166 (1998)","journal-title":"J. Algorithms"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"K.L. Clarkson","year":"1995","unstructured":"Clarkson, K.L.: Las Vegas algorithms for linear and integer programming when the dimension is small. J. ACM\u00a042, 488\u2013499 (1995)","journal-title":"J. ACM"},{"key":"7_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry Algorithms and Applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/trsc.18.4.351","volume":"18","author":"Z. Drezner","year":"1984","unstructured":"Drezner, Z.: The planar two-center and two-median problems. Transportation Science\u00a018, 351\u2013361 (1984)","journal-title":"Transportation Science"},{"key":"7_CR8","unstructured":"Eppstein, D.: Faster construction of planar two-centers. In: Proc. of SODA 1997, pp. 131\u2013138 (1997)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Fischer, K., Gartner, B.: The smallest enclosing ball of balls: combinatorial structure and algorithms. In: Proc. of SoCG 2003, pp. 292\u2013301 (2003)","DOI":"10.1145\/777792.777836"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. Gonzalez","year":"1985","unstructured":"Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci.\u00a038, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.comgeo.2009.03.007","volume":"43","author":"M. L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. Theory Appl.\u00a043, 419\u2013433 (2010)","journal-title":"Comput. Geom. Theory Appl."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/BF02187750","volume":"4","author":"N. Megiddo","year":"1989","unstructured":"Megiddo, N.: On the ball spanned by balls. Discr. Comput. Geom.\u00a04, 605\u2013610 (1989)","journal-title":"Discr. Comput. Geom."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/3-540-55210-3_213","volume-title":"STACS 92","author":"M. Sharir","year":"1992","unstructured":"Sharir, M., Welzl, E.: A Combinatorial Bound for Linear Programming and Related Problems. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 567\u2013579. Springer, Heidelberg (1992)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-68530-8_17","volume-title":"Algorithms - ESA \u201998","author":"C.-S. Shin","year":"1998","unstructured":"Shin, C.-S., Kim, J.-H., Kim, S.K., Chwa, K.-Y.: Two-center Problems for a Convex Polygon. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 199\u2013210. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T00:40:49Z","timestamp":1593304849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}