{"id":"https://openalex.org/W4378895326","doi":"https://doi.org/10.1145/3558481.3591077","title":"Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization","display_name":"Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization","publication_year":2023,"publication_date":"2023-05-31","ids":{"openalex":"https://openalex.org/W4378895326","doi":"https://doi.org/10.1145/3558481.3591077"},"language":"en","primary_location":{"id":"doi:10.1145/3558481.3591077","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3558481.3591077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092058636","display_name":"Alireza Haqi","orcid":"https://orcid.org/0009-0003-7087-3798"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Alireza Haqi","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran"],"raw_orcid":"https://orcid.org/0009-0003-7087-3798","affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091009084","display_name":"Hamid Zarrabi-Zadeh","orcid":"https://orcid.org/0000-0002-2279-4775"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hamid Zarrabi-Zadeh","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran"],"raw_orcid":"https://orcid.org/0000-0002-2279-4775","affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I133529467"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"239","last_page":"247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6665442585945129},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6359692215919495},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5456323623657227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5294373035430908},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5280343294143677},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4704540967941284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41399022936820984},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3780948519706726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36432403326034546},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3640725016593933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.25743675231933594},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15558433532714844}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6665442585945129},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6359692215919495},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5456323623657227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5294373035430908},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5280343294143677},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4704540967941284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41399022936820984},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3780948519706726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36432403326034546},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3640725016593933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25743675231933594},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15558433532714844},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3558481.3591077","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3558481.3591077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1965734368","https://openalex.org/W1973264045","https://openalex.org/W2003719999","https://openalex.org/W2034616054","https://openalex.org/W2037568170","https://openalex.org/W2039797405","https://openalex.org/W2044028871","https://openalex.org/W2100061495","https://openalex.org/W2162165238","https://openalex.org/W2189949549","https://openalex.org/W2604855139","https://openalex.org/W2953741525","https://openalex.org/W2962677563","https://openalex.org/W2963388857","https://openalex.org/W2963629655","https://openalex.org/W2963813153","https://openalex.org/W3041372643","https://openalex.org/W3172434813","https://openalex.org/W3174154718","https://openalex.org/W4213146104","https://openalex.org/W4240139199","https://openalex.org/W4286210465"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W4298130764","https://openalex.org/W1560496689","https://openalex.org/W1992739770","https://openalex.org/W2804364458","https://openalex.org/W4386900933","https://openalex.org/W4229058035","https://openalex.org/W2132641928","https://openalex.org/W4310225030","https://openalex.org/W2090259340"],"abstract_inverted_index":{"Clustering":[0],"and":[1,15,21,30,97,156],"diversification":[2],"are":[3,24,146],"two":[4,25],"central":[5],"problems":[6,32,37],"with":[7,41,69],"various":[8],"applications":[9,176],"in":[10,33,47,100,115,164,196,200],"machine":[11],"learning,":[12],"data":[13],"mining,":[14],"information":[16],"retrieval.":[17],"The":[18],"k-center":[19,95],"clustering":[20,96],"k-diversity":[22,98],"maximization":[23,99],"of":[26,45,111,135,140,172,177],"the":[27,56,70,79,101,128,132,138,193,201],"most":[28],"well-studied":[29],"widely-used":[31],"this":[34,82,86],"area.":[35],"Both":[36],"admit":[38],"sequential":[39],"algorithms":[40,54,73,93,145],"optimal":[42,58,187],"approximation":[43,59,109],"factors":[44,75],"2":[46,112,136],"any":[48,116,120,197],"metric":[49,117,198],"space.":[50],"However,":[51],"finding":[52,157],"distributed":[53,92],"matching":[55],"same":[57],"ratios":[60],"has":[61],"been":[62],"open":[63,87],"for":[64,94,119,152,192],"more":[65],"than":[66],"a":[67,149,158,169],"decade,":[68],"best":[71,129],"current":[72],"having":[74],"at":[76],"least":[77],"twice":[78],"optimal.":[80],"In":[81],"paper,":[83],"we":[84],"settle":[85],"problem":[88,195],"by":[89],"presenting":[90],"constant-round":[91],"massively":[102],"parallel":[103],"computation":[104],"(MPC)":[105],"model,":[106],"achieving":[107],"an":[108,185],"factor":[110],"+":[113,189],"\u03b5":[114,122],"space":[118,199],"constant":[121,170],">":[123],"0,":[124],"which":[125],"is":[126,181],"essentially":[127],"possible":[130],"considering":[131],"lower":[133],"bound":[134],"on":[137,148],"approximability":[139],"both":[141],"these":[142],"problems.":[143],"Our":[144],"based":[147],"novel":[150],"technique":[151,180],"approximating":[153],"vertex":[154],"degrees":[155],"so-called":[159],"k-bounded":[160],"maximal":[161],"independent":[162],"set":[163],"threshold":[165],"graphs,":[166],"using":[167],"only":[168],"number":[171],"MPC":[173,202],"rounds.":[174],"Other":[175],"our":[178],"general":[179],"also":[182],"implied,":[183],"including":[184],"almost":[186],"(3":[188],"\u03b5)-approximation":[190],"algorithm":[191],"k-supplier":[194],"model.":[203]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}