{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:57Z","timestamp":1759639077463,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030578510"},{"type":"electronic","value":"9783030578527"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-57852-7_6","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T23:07:54Z","timestamp":1598569674000},"page":"72-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Algorithms for Distributed Balanced Clustering"],"prefix":"10.1007","author":[{"given":"Kian","family":"Mirjalali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,28]]},"reference":[{"key":"6_CR1","unstructured":"Aghamolaei, S., Farhadi, M., Zarrabi-Zadeh, H.: Diversity maximization via composable coresets. In: Proceedings of 27th Canadian Conference on Computational Geometry, p. 43 (2015)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10107-014-0857-y","volume":"154","author":"H-C An","year":"2015","unstructured":"An, H.-C., Bhaskara, A., Chekuri, C., Gupta, S., Madan, V., Svensson, O.: Centrality of trees for capacitated $$k$$-center. Math. Program. 154(1), 29\u201353 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0857-y","journal-title":"Math. Program."},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J Barilan","year":"1993","unstructured":"Barilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms 15(3), 385\u2013415 (1993)","journal-title":"J. Algorithms"},{"key":"6_CR4","unstructured":"Bateni, M., Bhaskara, A., Lattanzi, S., Mirrokni, V.: Distributed balanced clustering via mapping coresets. In: Proceedings of the 27th Annual Conference on Neural Information Processing Systems, pp. 2591\u20132599 (2014)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Ceccarello, M., Pietracaprina, A., Pucci, G.: Solving $$k$$-center clustering (with outliers) in mapreduce and streaming, almost as accurately as sequentially. In: Proceedings of the 45th International Conference on Very Large Data Bases, vol. 12, pp. 766\u2013778 (2019)","DOI":"10.14778\/3317315.3317319"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-59250-3_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"D Chakrabarty","year":"2017","unstructured":"Chakrabarty, D., Krishnaswamy, R., Kumar, A.: The heterogeneous capacitated k-center problem. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 123\u2013135. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_11"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1137\/070699007","volume":"39","author":"K Chen","year":"2009","unstructured":"Chen, K.: On coresets for $$k$$-median and $$k$$-means clustering in metric and Euclidean spaces and their applications. SIAM J. Comput. 39(3), 923\u2013947 (2009)","journal-title":"SIAM J. Comput."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M., Hajiaghayi, M., Khuller, S.: LP rounding for $$k$$-centers with non-uniform hard capacities. In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 273\u2013282 (2012)","DOI":"10.1109\/FOCS.2012.63"},{"key":"6_CR9","unstructured":"Cygan, M., Kociumaka, T.: Constant factor approximation for capacitated $$k$$-center with outliers. In: Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science, STACS 2014, vol. 25, pp. 251\u2013262 (2014)"},{"key":"6_CR10","unstructured":"Ding, H.: Balanced $$k$$-center clustering when $$k$$ is a constant. In: Proceedings of the 29th Canadian Conference on Computational Geometry, pp. 179\u2013184 (2017)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-62127-2_28","volume-title":"Algorithms and Data Structures","author":"H Ding","year":"2017","unstructured":"Ding, H., Hu, L., Huang, L., Li, J.: Capacitated center problems with two-sided bounds and outliers. WADS 2017. LNCS, vol. 10389, pp. 325\u2013336. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_28"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Ene, A., Im, S., Moseley, B.: Fast clustering using mapreduce. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 681\u2013689 (2011)","DOI":"10.1145\/2020408.2020515"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Fernandes, C.G., de Paula, S.P., Pedrosa, L.L.C.: Improved approximation algorithms for capacitated fault-tolerant $$k$$-center. In: Proceedings of the12th Latin American Theoretical Information on Symposium, pp. 441\u2013453 (2016)","DOI":"10.1007\/978-3-662-49529-2_33"},{"key":"6_CR14","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. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"6_CR15","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."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B.: Brief announcement: fast and better distributed mapreduce algorithms for $$k$$-center clustering. In: Proceedings of the 27th ACM Symposium on Parallel Algorithms Architecture, pp. 65\u201367 (2015)","DOI":"10.1145\/2755573.2755607"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Indyk, P., Mahabadi, S., Mahdian, M., Mirrokni, V.S.: Composable core-sets for diversity and coverage maximization. In: Proceedings of the 33rd Symposium on Principles of Database Systems, pp. 100\u2013108 (2014)","DOI":"10.1145\/2594538.2594560"},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated $$k$$-center problem. SIAM J. Discrete Math. 13(3), 403\u2013418 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR19","unstructured":"Malkomes, G., Kusner, M.J., Chen, W., Weinberger, K.Q., Moseley, B.: Fast distributed $$k$$-center clustering with outliers on massive data. In: Proceedings of the 28th Annual Conference on Neural Information Processing Systems, pp. 1063\u20131071 (2015)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"McClintock, J., Wirth, A.: Efficient parallel algorithms for $$k$$-center clustering. In: Proceedings of the 45th International Conference on Parallel Processing, pp. 133\u2013138 (2016)","DOI":"10.1109\/ICPP.2016.22"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-85363-3_14","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"R Matthew McCutchen","year":"2008","unstructured":"Matthew McCutchen, R., Khuller, S.: Streaming algorithms for k-center clustering with outliers and with anonymity. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX\/RANDOM-2008. LNCS, vol. 5171, pp. 165\u2013178. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85363-3_14"},{"key":"6_CR22","unstructured":"Mirjalali, K., Tabatabaee, S.A., Zarrabi-Zadeh, H.: Distributed unit clustering. In: Proceedings of the 31st Canadian Conference on Computational Geometry, pp. 236\u2013241 (2019)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Mirrokni, V.S., Zadimoghaddam, M.: Randomized composable core-sets for distributed submodular maximization. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pp. 153\u2013162 (2015)","DOI":"10.1145\/2746539.2746624"}],"container-title":["Lecture Notes in Computer Science","Topics in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57852-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:02:48Z","timestamp":1724803368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57852-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030578510","9783030578527"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57852-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Topics in Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tehran","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iran","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icttcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.ipm.ac.ir\/ttcs\/2020\/","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":"24","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":"8","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":"33% - 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":"2","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 conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}