{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:18:42Z","timestamp":1760440722314},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_30","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T09:37:43Z","timestamp":1196329063000},"page":"299-309","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Algorithms for Two-Center Problems for a Convex Polygon"],"prefix":"10.1007","author":[{"given":"Sung Kwon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"P. K. Agarwal and M. Sharir and E. Welzl, The discrete 2-center problem, Proc. 13th Ann. ACM Symp. Comput. Geom., pp. 147\u2013155, 1997.","DOI":"10.1145\/262839.262921"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(89)90031-8","volume":"32","author":"L. Boxer","year":"1989","unstructured":"L. Boxer and R. Miller, A parallel circle-cover minimization algorithm, Inform. Process. Lett., 32, pp. 57\u201360, 1989.","journal-title":"Inform. Process. Lett."},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"T. M. Chan","year":"1999","unstructured":"T. M. Chan, More planar two-center algorithms, Computational Geometry: Theory and Applications, 13, pp. 189\u2013198, 1999","journal-title":"Computational Geometry: Theory and Applications"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle, and L. J. Guibas, Fractional cascading: I. A data structuring technique, Algorithmica, 1, pp. 133\u2013162, 1986.","journal-title":"Algorithmica"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01840441","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle, and L. J. Guibas, Fractional cascading: II. Applications, Algorithmica, 1, pp. 163\u2013191, 1986.","journal-title":"Algorithmica"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"S.-W. Cheng, O. Cheong, H. Everett, and R. van Oostrum, Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons, Proc. 15th Ann. ACM Symp. Comput. Geom., pp. 227\u2013236, 1999.","DOI":"10.1145\/304893.304976"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. ACM, 34, pp. 200\u2013208, 1987.","journal-title":"J. ACM"},{"key":"30_CR8","unstructured":"D. Eppstein, Faster construction of planar two-centers, Proc. 8th ACM-SIAM Symp. Discrete Algorithms, pp. 131\u2013138, 1997."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"J. Friedman, J. Hershberger, and J. Snoeyink, Compliant motion in a simple polygon, Proc. 5th Ann. ACM Symp. Comput. Geom., pp. 175\u2013186, 1989.","DOI":"10.1145\/73833.73854"},{"key":"30_CR10","unstructured":"S. K. Kim, Parallel algorithms for geometric intersection graphs, Ph.D. Thesis, Dept. of Comput. Sci. Eng., U. of Washington, 1990."},{"key":"30_CR11","unstructured":"S. K. Kim, and C.-S. Shin, Efficient algorithms for two-center problems for a convex polygon, HKUST-TCSC-1999-16, Dept. of Comp. Sci., HKUST, 1999."},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(84)90033-4","volume":"18","author":"C. C. Lee","year":"1984","unstructured":"C. C. Lee and D. T. Lee, On a circle-cover minimization problem, Inform. Process. Lett., 18, pp. 109\u2013115, 1984.","journal-title":"Inform. Process. Lett."},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, 30, pp. 852\u2013865, 1983.","journal-title":"J. ACM"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"M. Sharir, A Near-Linear Algorithm for the Planar 2-Center Problem, Proc. 12th Ann. ACM Symp. Comput. Geom., pp. 106\u2013112, 1996.","DOI":"10.1145\/237218.237251"},{"key":"30_CR15","first-page":"199","volume":"1461","author":"C.-S. Shin","year":"1998","unstructured":"C.-S. Shin, J.-H. Kim, S. K. Kim, and K.-Y. Chwa, Two-center problems for a convex polygon, Proc. 6th Euro. Symp. on Algo., Vol. 1461, pp. 199\u2013210, 1998.","journal-title":"Proc. 6th Euro. Symp. on Algo."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T08:17:07Z","timestamp":1557044227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}