{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:54Z","timestamp":1783576974558,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591077","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"239-247","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-7087-3798","authenticated-orcid":false,"given":"Alireza","family":"Haqi","sequence":"first","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2279-4775","authenticated-orcid":false,"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10926"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331596"},{"key":"e_1_3_2_1_3_1","first-page":"2591","volume-title":"Proc. 27th Annu. Conf. Neural Info. Proc. Systems","author":"Bateni M.","year":"2014","unstructured":"M. Bateni, A. Bhaskara, S. Lattanzi, and V. Mirrokni. Distributed balanced clus- tering via mapping coresets. In Proc. 27th Annu. Conf. Neural Info. Proc. Systems, pages 2591--2599, 2014."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16513"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331609"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3317315.3317319"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331607"},{"key":"e_1_3_2_1_8_1","first-page":"642","volume-title":"Proc. 12th ACM-SIAM Sympos. Discrete Algorithms","author":"Charikar M.","year":"2001","unstructured":"M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. In Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pages 642--651, 2001."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538449"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-030-29414-4","volume-title":"Theory of evolutionary computation","author":"Doerr B.","year":"2020","unstructured":"B. Doerr. Probabilistic tools for the analysis of randomized optimization heuristics. In Theory of evolutionary computation, pages 1--87. Springer, 2020."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020515"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.66"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323172"},{"key":"e_1_3_2_1_14_1","volume-title":"Improved mpc algorithms for mis, matching, and coloring on trees and beyond. arXiv preprint arXiv:2002.09610","author":"Ghaffari M.","year":"2020","unstructured":"M. Ghaffari, C. Grunau, and C. Jin. Improved mpc algorithms for mis, matching, and coloring on trees and beyond. arXiv preprint arXiv:2002.09610, 2020."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400260"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_17_1","volume-title":"A best possible heuristic for the k-center problem. Mathematics of operations research, 10(2):180--184","author":"Hochbaum D. S.","year":"1985","unstructured":"D. S. Hochbaum and D. B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of operations research, 10(2):180--184, 1985."},{"key":"e_1_3_2_1_18_1","volume-title":"A unified approach to approximation algorithms for bottleneck problems. 33(3):533--550","author":"Hochbaum D. S.","year":"1986","unstructured":"D. S. Hochbaum and D. B. Shmoys. A unified approach to approximation algorithms for bottleneck problems. 33(3):533--550, 1986."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594560"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.76"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_22_1","first-page":"28","article-title":"Fast distributed k-center clustering with outliers on massive data","author":"Malkomes G.","year":"2015","unstructured":"G. Malkomes, M. J. Kusner, W. Chen, K. Q. Weinberger, and B. Moseley. Fast distributed k-center clustering with outliers on massive data. Advances in Neural Information Processing Systems, 28, 2015.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746624"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.2.299"},{"key":"e_1_3_2_1_25_1","first-page":"5600","volume-title":"International Conference on Machine Learning","author":"Yaroslavtsev G.","year":"2018","unstructured":"G. Yaroslavtsev and A. Vadapalli. Massively parallel algorithms and hardness for single-linkage clustering under lp distances. In International Conference on Machine Learning, pages 5600--5609. PMLR, 2018."}],"event":{"name":"SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Orlando FL USA","acronym":"SPAA '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591077","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:33Z","timestamp":1750182573000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":25,"alternative-id":["10.1145\/3558481.3591077","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591077","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}