{"id":"https://openalex.org/W2953741525","doi":"https://doi.org/10.1145/3323165.3323172","title":"Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement)","display_name":"Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement)","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2953741525","doi":"https://doi.org/10.1145/3323165.3323172","mag":"2953741525"},"language":"en","primary_location":{"id":"doi:10.1145/3323165.3323172","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st 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/A5037972828","display_name":"Alessandro Epasto","orcid":"https://orcid.org/0000-0003-0456-3217"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alessandro Epasto","raw_affiliation_strings":["Google, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075598023","display_name":"Vahab Mirrokni","orcid":"https://orcid.org/0000-0001-6705-5629"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vahab Mirrokni","raw_affiliation_strings":["Google, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024817143","display_name":"Morteza Zadimoghaddam","orcid":"https://orcid.org/0000-0003-0717-1120"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Morteza Zadimoghaddam","raw_affiliation_strings":["Google, Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"41","last_page":"42"},"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.9969000220298767,"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.9969000220298767,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9891999959945679,"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"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9753000140190125,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7285470962524414},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6818879246711731},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5083290934562683},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46967822313308716},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4452551007270813},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4400518834590912},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43760591745376587},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.4374564290046692},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4298287630081177},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4282938838005066},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4160844683647156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38192352652549744},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3767496645450592},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3038070499897003},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23357641696929932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1980258822441101},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.19739174842834473}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7285470962524414},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6818879246711731},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5083290934562683},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46967822313308716},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4452551007270813},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4400518834590912},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43760591745376587},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.4374564290046692},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4298287630081177},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4282938838005066},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4160844683647156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38192352652549744},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3767496645450592},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3038070499897003},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23357641696929932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1980258822441101},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.19739174842834473},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3323165.3323172","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st 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":3,"referenced_works":["https://openalex.org/W2037568170","https://openalex.org/W2039797405","https://openalex.org/W2604855139"],"related_works":["https://openalex.org/W1824789409","https://openalex.org/W3191101401","https://openalex.org/W2241126753","https://openalex.org/W2947806671","https://openalex.org/W2390878257","https://openalex.org/W3122033752","https://openalex.org/W2295466155","https://openalex.org/W4234540089","https://openalex.org/W4289866588","https://openalex.org/W2964056228"],"abstract_inverted_index":{"In":[0,95],"this":[1,44,125],"paper,":[2],"we":[3,58,97,158],"study":[4,59],"the":[5,36,47,75,82,88,118,150],"diversity":[6],"maximization":[7],"problem":[8,45],"(a.k.a.":[9],"maximum":[10,37],"dispersion":[11],"problem)":[12],"in":[13,21,74,149,162,174],"which":[14],"given":[15],"a":[16,22,29,99],"set":[17],"of":[18,31,39,91,115,188],"n":[19],"objects":[20,34],"metric":[23],"space,":[24],"one":[25],"wants":[26],"to":[27,172,178],"find":[28],"subset":[30],"k":[32],"distinct":[33],"with":[35,140,185],"sum":[38],"pairwise":[40],"distances.":[41],"We":[42],"address":[43],"using":[46,165],"distributed":[48,101,152],"framework":[49],"known":[50,120],"as":[51,133],"randomized":[52],"composable":[53],"core-sets[3].":[54],"Unlike":[55],"previous":[56],"work,":[57],"small-size":[60,166],"core-set":[61,167],"algorithms":[62,128,168],"allowing":[63],"minimum":[64],"possible":[65],"intermediate":[66],"output":[67],"size":[68],"(and":[69],"hence":[70],"achieving":[71,182],"large":[72,141],"speed-up":[73],"computation":[76],"and":[77,80,110,131,143],"increased":[78],"parallelism),":[79],"at":[81],"same":[83],"time,":[84],"improving":[85],"significantly":[86],"over":[87],"approximation":[89,113,122,186],"guarantees":[90],"state-of-the-art":[92],"core-set-based":[93],"algorithms.":[94],"particular,":[96],"present":[98],"simple":[100],"algorithm":[102],"that":[103],"achieves":[104,112],"an":[105],"almost":[106],"optimal":[107],"communication":[108],"complexity,":[109],"asymptotically":[111],"factor":[114,123,187],"1/2,":[116],"matching":[117],"best":[119],"global":[121],"for":[124],"problem.":[126],"Our":[127],"are":[129],"scalable":[130],"practical":[132],"shown":[134],"by":[135],"our":[136],"extensive":[137],"empirical":[138],"evaluation":[139],"datasets":[142],"they":[144],"can":[145],"be":[146],"easily":[147],"used":[148],"major":[151],"computing":[153],"systems":[154],"like":[155],"MapReduce.":[156],"Furthermore,":[157],"show":[159],"empirically":[160],"that,":[161],"real-life":[163],"instances,":[164],"allows":[169],"speed-ups":[170],"up":[171],">68":[173],"running":[175],"time":[176],"w.r.t.":[177],"large-size":[179],"core-sets":[180],"while":[181],"close-to-optimal":[183],"solutions":[184],">90%.":[189]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}