{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:59:24Z","timestamp":1742929164716,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_12","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"165-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Covering Convex Polygons by Two Congruent Disks"],"prefix":"10.1007","author":[{"given":"Jongmin","family":"Choi","sequence":"first","affiliation":[]},{"given":"Dahye","family":"Jeong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-1679","authenticated-orcid":false,"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.comgeo.2012.11.005","volume":"46","author":"PK Agarwal","year":"2013","unstructured":"Agarwal, P.K., Ben Avraham, R., Sharir, M.: The 2-center problem in three dimensions. Computat. Geom. Theor. Appl. 46(6), 734\u2013746 (2013)","journal-title":"Computat. Geom. Theor. Appl."},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"PK Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica 33(2), 201\u2013226 (2002). https:\/\/doi.org\/10.1007\/s00453-001-0110-y","journal-title":"Algorithmica"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01182774","volume":"11","author":"PK Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M.: Planar geometric location problems. Algorithmica 11(2), 185\u2013195 (1994). https:\/\/doi.org\/10.1007\/BF01182774","journal-title":"Algorithmica"},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comput. Surv. 30(4), 412\u2013458 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s00453-013-9846-4","volume":"72","author":"P Agarwal","year":"2015","unstructured":"Agarwal, P., Sharathkumar, R.: Streaming algorithms for extent problems in high dimensions. Algorithmica 72(1), 83\u201398 (2015)","journal-title":"Algorithmica"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/S0218195914500058","volume":"24","author":"HK Ahn","year":"2014","unstructured":"Ahn, H.K., Kim, H.S., Kim, S.S., Son, W.: Computing $$k$$ centers over streaming data for small $$k$$. Int. J. Comput. Geom. Appl. 24(2), 107\u2013123 (2014)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/s00454-016-9796-0","volume":"56","author":"HK Ahn","year":"2016","unstructured":"Ahn, H.K., Barba, L., Bose, P., Carufel, J.L.D., Korman, M., Oh, E.: A linear-time algorithm for the geodesic center of a simple polygon. Discrete Comput. Geom. 56(4), 836\u2013859 (2016). https:\/\/doi.org\/10.1007\/s00454-016-9796-0","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.comgeo.2012.09.002","volume":"46","author":"HK Ahn","year":"2013","unstructured":"Ahn, H.K., Kim, S.S., Knauer, C., Schlipf, L., Shin, C.S., Vigneron, A.: Covering and piercing disks with two centers. Comput. Geom. Theor. Appl. 46(3), 253\u2013262 (2013)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s00454-019-00110-0","volume":"62","author":"SW Bae","year":"2019","unstructured":"Bae, S.W.: $${L}_1$$ geodesic farthest neighbors in a simple polygon and related problems. Discrete Comput. Geom. 62(4), 743\u2013774 (2019)","journal-title":"Discrete Comput. Geom."},{"issue":"02","key":"12_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1142\/S0129054120500070","volume":"31","author":"M Basappa","year":"2020","unstructured":"Basappa, M., Jallu, R.K., Das, G.K.: Constrained $$k$$-center problem on a convex polygon. Int. J. Found. Comput. Sci. 31(02), 275\u2013291 (2020)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"TM Chan","year":"1999","unstructured":"Chan, T.M.: More planar two-center algorithms. Comput. Geom. Theor. Appl. 13(3), 189\u2013198 (1999)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.comgeo.2013.05.007","volume":"47","author":"T Chan","year":"2014","unstructured":"Chan, T., Pathak, V.: Streaming and dynamic algorithms for minimum enclosing balls in high dimensions. Comput. Geom. Theor. Appl. 47(2), 240\u2013247 (2014)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"12_CR13","unstructured":"Cho, K., Oh, E.: Optimal algorithm for the planar two-center problem. arXiv:2007.08784 (2020)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"101768","DOI":"10.1016\/j.comgeo.2021.101768","volume":"97","author":"J Choi","year":"2021","unstructured":"Choi, J., Ahn, H.K.: Efficient planar two-center algorithms. Comput. Geom. 97, 101768 (2021)","journal-title":"Comput. Geom."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Choi, J., Jeong, D., Ahn, H.K.: Covering convex polygons by two congruent disks. arXiv:2105.02483 (2021)","DOI":"10.1007\/978-3-030-79987-8_12"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200\u2013208 (1987)","journal-title":"J. ACM"},{"issue":"02","key":"12_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1142\/S0129054108005747","volume":"19","author":"GK Das","year":"2008","unstructured":"Das, G.K., Roy, S., Das, S., Nandy, S.C.: Variations of base-station placement problem on the boundary of a convex region. Int. J. Found. Comput. Sci. 19(02), 405\u2013427 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"12_CR18","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/TIT.1983.1056714","volume":"29","author":"H Edelsbrunner","year":"1983","unstructured":"Edelsbrunner, H., Kirkpatrick, D., Seidel, R.: On the shape of a set of points in the plane. IEEE Trans. Inf. Theor. 29(4), 551\u2013559 (1983)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"issue":"5","key":"12_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1142\/S0218195904001500","volume":"4","author":"K Fischer","year":"2004","unstructured":"Fischer, K., G\u00e4rtner, B.: The smallest enclosing ball of balls: combinatorial structure and algorithms. Int. J. Comput. Geom. Appl. 4(5), 341\u2013378 (2004)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.comgeo.2006.10.004","volume":"39","author":"J Hershberger","year":"2008","unstructured":"Hershberger, J., Suri, S.: Adaptive sampling for geometric problems over data streams. Comput. Geom. Theor. Appl. 39(3), 191\u2013208 (2008)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/0196-6774(91)90013-O","volume":"12","author":"J Hershberger","year":"1991","unstructured":"Hershberger, J., Suri, S.: Finding tailored partitions. J. Algorithms 12(3), 431\u2013463 (1991)","journal-title":"J. Algorithms"},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01185335","volume":"9","author":"R Hwang","year":"1993","unstructured":"Hwang, R., Lee, R.C.T., Chang, R.: The slab dividing approach to solve the Euclidean $$p$$-center problem. Algorithmica 9(1), 1\u201322 (1993). https:\/\/doi.org\/10.1007\/BF01185335","journal-title":"Algorithmica"},{"issue":"9","key":"12_CR25","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.comgeo.2015.06.003","volume":"48","author":"SS Kim","year":"2015","unstructured":"Kim, S.S., Ahn, H.K.: An improved data stream algorithm for clustering. Comput. Geom. Theor. Appl. 48(9), 635\u2013645 (2015)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-44968-X_30","volume-title":"Computing and Combinatorics","author":"SK Kim","year":"2000","unstructured":"Kim, S.K., Shin, C.-S.: Efficient algorithms for two-center problems for a convex polygon. In: Du, D.-Z.-Z., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 299\u2013309. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44968-X_30"},{"issue":"4","key":"12_CR27","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. Theor. Appl. 43(4), 419\u2013433 (2010)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"6","key":"12_CR28","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. Discrete Comput. Geom. 4(6), 605\u2013610 (1989). https:\/\/doi.org\/10.1007\/BF02187750","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"12_CR29","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM 31(1), 114\u2013127 (1984)","journal-title":"J. ACM"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.comgeo.2018.02.008","volume":"74","author":"E Oh","year":"2018","unstructured":"Oh, E., De Carufel, J.L., Ahn, H.K.: The geodesic 2-center problem in a simple polygon. Comput. Geom. Theor. Appl. 74, 21\u201337 (2018)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"2","key":"12_CR31","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.jpdc.2007.08.005","volume":"68","author":"S Roy","year":"2008","unstructured":"Roy, S., Bardhan, D., Das, S.: Base station placement on boundary of a convex polygon. J. Parallel Distrib. Comput. 68(2), 265\u2013273 (2008)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"12_CR32","doi-asserted-by":"publisher","first-page":"119","DOI":"10.3233\/FI-2019-1757","volume":"164","author":"S Sadhu","year":"2019","unstructured":"Sadhu, S., Roy, S., Nandi, S., Maheshwari, A., Nandy, S.C.: Two-center of the convex hull of a point set: dynamic model, and restricted streaming model. Fundamenta Informaticae 164(1), 119\u2013138 (2019)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"12_CR33","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00009311","volume":"18","author":"M Sharir","year":"1997","unstructured":"Sharir, M.: A near-linear algorithm for the planar 2-center problem. Discrete Comput. Geom. 18(2), 125\u2013134 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-68530-8_17","volume-title":"Algorithms \u2014 ESA\u2019 98","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 (extended abstract). In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 199\u2013210. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-68530-8_17"},{"key":"12_CR35","unstructured":"Wang, H.: On the planar two-center problem and circular hulls. In: Proceeding of the 36th International Symposium on Computational Geometry (SoCG 2020), vol. 164, pp. 68:1\u201368:14 (2020)"},{"key":"12_CR36","unstructured":"Wang, H.: On the planar two-center problem and circular hulls. arXiv preprint arXiv:2002.07945 (2020)"},{"key":"12_CR37","unstructured":"Zarrabi-Zadeh, H.: Core-preserving algorithms. In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry (CCCG 2008), pp. 159\u2013162 (2008)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T01:56:41Z","timestamp":1672624601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}