{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:01:26Z","timestamp":1743040886923,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_50","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"561-572","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Separated Red-Blue Center Clustering"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Sha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"3","key":"50_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.comgeo.2012.09.002","volume":"46","author":"H-K 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. 46(3), 253\u2013262 (2013)","journal-title":"Comput. Geom."},{"issue":"2","key":"50_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1142\/S0218195911003597","volume":"21","author":"P Brass","year":"2011","unstructured":"Brass, P., Knauer, C., Na, H.-S., Shin, C.-S., Vigneron, A.: The aligned k-center problem. Int. J. Comput. Geom. Appl. 21(2), 157\u2013178 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"50_CR3","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.comgeo.2010.11.004","volume":"44","author":"O Cheong","year":"2011","unstructured":"Cheong, O., et al.: Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4), 234\u2013247 (2011)","journal-title":"Comput. Geom."},{"unstructured":"Eskandari, M., Khare, B.B., Kumar, N.: Separated red blue center clustering. In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, Fukuoka, Japan, 6\u20138 December 2021 (2021)","key":"50_CR4"},{"doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2\u20134 May 1988, pp. 434\u2013444. ACM (1988)","key":"50_CR5","DOI":"10.1145\/62212.62255"},{"issue":"4","key":"50_CR6","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00454-008-9107-5","volume":"40","author":"J Gao","year":"2008","unstructured":"Gao, J., Langberg, M., Schulman, L.J.: Analysis of incomplete data and an intrinsic-dimension Helly theorem. Discret. Comput. Geom. 40(4), 537\u2013560 (2008)","journal-title":"Discret. Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Gao, J., Langberg, M., Schulman, L.J.: Clustering lines in high-dimensional space: classification of incomplete data. ACM Trans. Algorithms 7(1), 8:1\u20138:26 (2010)","key":"50_CR7","DOI":"10.1145\/1868237.1868246"},{"key":"50_CR8","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":"2","key":"50_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"50_CR10","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM 33(3), 533\u2013550 (1986)","journal-title":"J. ACM"},{"issue":"3","key":"50_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W-L Hsu","year":"1979","unstructured":"Hsu, W.-L., Nemhauser, G.L.: Easy and hard bottleneck location problems. Discret. Appl. Math. 1(3), 209\u2013215 (1979)","journal-title":"Discret. Appl. Math."},{"unstructured":"Huang, H., Klimenko, G., Raichel, B.L Clustering with neighborhoods. In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, Fukuoka, Japan, 6\u20138 December 2021 (2021)","key":"50_CR12"},{"issue":"2","key":"50_CR13","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/s10878-012-9452-4","volume":"25","author":"A Karmakar","year":"2013","unstructured":"Karmakar, A., Das, S., Nandy, S.C., Bhattacharya, B.K.: Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2), 176\u2013190 (2013)","journal-title":"J. Comb. Optim."},{"doi-asserted-by":"crossref","unstructured":"Lee, E., Schulman, L.J.: Clustering affine subspaces: hardness and algorithms. In: Khanna, S. (ed.) Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, 6\u20138 January 2013, pp. 810\u2013827. SIAM (2013)","key":"50_CR14","DOI":"10.1137\/1.9781611973105.58"},{"unstructured":"Mentzer, S.G.: Lower bounds on metric k-center problems, Manuscript (1988)","key":"50_CR15"},{"doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: An optimal algorithm for the all-nearest-neighbors problem. In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27\u201329 October 1986, pp. 117\u2013122. IEEE Computer Society (1986)","key":"50_CR16","DOI":"10.1109\/SFCS.1986.8"},{"issue":"3\u20134","key":"50_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1142\/S0218195916600049","volume":"26","author":"H Wang","year":"2016","unstructured":"Wang, H., Zhang, J.: Line-constrained k-median, k-means, and k-center problems in the plane. Int. J. Comput. Geom. Appl. 26(3\u20134), 185\u2013210 (2016)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"50_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.comgeo.2007.12.002","volume":"43","author":"X Guang","year":"2010","unstructured":"Guang, X., Jinhui, X.: Efficient approximation algorithms for clustering point-sets. Comput. Geom. 43(1), 59\u201366 (2010)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T09:38:18Z","timestamp":1728639498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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","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":"5","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)"}}]}}