{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:18:31Z","timestamp":1760440711766},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648482"},{"type":"electronic","value":"9783540685302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68530-8_17","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T22:14:16Z","timestamp":1194560056000},"page":"199-210","source":"Crossref","is-referenced-by-count":8,"title":["Two-Center Problems for a Convex Polygon (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Chan-Su","family":"Shin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jung-Hyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung Kwon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"P. K. Agarwal, M. Sharir, and E. Welzl. The discrete 2-center problem. In Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997. 147\u2013155.","key":"17_CR1","DOI":"10.1145\/262839.262921"},{"issue":"6","key":"17_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BF02187749","volume":"4","author":"A. Aggarwal","year":"1989","unstructured":"A. Aggarwal, L. J. Guibas, J. Saxe, and P.W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom., 4(6):591\u2013604, 1989.","journal-title":"Discrete Comput. Geom."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A. Aggarwal","year":"1987","unstructured":"A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber. Geometric applications of a matrix-searching algorithm. Algorithmica, 2:195\u2013208, 1987.","journal-title":"Algorithmica"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0218035","volume":"18","author":"M. J. Atallah","year":"1989","unstructured":"M. J. Atallah, R. Cole, and M. T. Goodrich. Cascading divide-and-conquer: A technique for designing parallel algorithms. SIAM J. Comput., 18:499\u2013532, 1989.","journal-title":"SIAM J. Comput."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/BF01762130","volume":"3","author":"M. J. Atallah","year":"1988","unstructured":"M. J. Atallah and M. T. Goodrich. Parallel algorithms for some functions of two convex polygons. Algorithmica, 3:535\u2013548, 1988.","journal-title":"Algorithmica"},{"issue":"2","key":"17_CR6","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(2):57\u201360, 1989.","journal-title":"Inform. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"T. M. Chan. Deterministic algorithms for 2-d convex programming and 3-d online linear programming. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 464\u2013472, 1997.","key":"17_CR7","DOI":"10.1006\/jagm.1997.0914"},{"key":"17_CR8","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:133\u2013162, 1986.","journal-title":"Algorithmica"},{"unstructured":"D. Eppstein. Faster construction of planar two-centers. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997.","key":"17_CR9"},{"doi-asserted-by":"crossref","unstructured":"V. Estivill-Castro and J. Urrutia. Two-floodlight illumination of convex polygons. In Proc. 4th Workshop Algorithms Data Struct., pages 62\u201373, 1995.","key":"17_CR10","DOI":"10.1007\/3-540-60220-8_51"},{"unstructured":"S. K. Kim. Parallel algorithms for geometric intersection graphs. Ph.D. thesis, CS Dept., U. of Washington, 1990.","key":"17_CR11"},{"key":"17_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:109\u2013115, 1984.","journal-title":"Inform. Process. Lett."},{"key":"17_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:852\u2013865, 1983.","journal-title":"J. ACM"},{"key":"17_CR14","doi-asserted-by":"crossref","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, NY, 1985."},{"doi-asserted-by":"crossref","unstructured":"M. Sharir. A near-linear algorithm for the planar 2-center problem. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 106\u2013112, 1996.","key":"17_CR15","DOI":"10.1145\/237218.237251"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. Valiant","year":"1975","unstructured":"L. Valiant. Parallelism in comparison problems. SIAM J. Comput., 4(3):348\u2013355, 1975.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA\u2019 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68530-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T17:24:26Z","timestamp":1684085066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68530-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648482","9783540685302"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-68530-8_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}