{"id":"https://openalex.org/W2177862760","doi":"https://doi.org/10.1145/2809814","title":"Fast Greedy Algorithms in MapReduce and Streaming","display_name":"Fast Greedy Algorithms in MapReduce and Streaming","publication_year":2015,"publication_date":"2015-09-08","ids":{"openalex":"https://openalex.org/W2177862760","doi":"https://doi.org/10.1145/2809814","mag":"2177862760"},"language":"en","primary_location":{"id":"doi:10.1145/2809814","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2809814","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"type":"article","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/A5101772779","display_name":"Ravi Kumar","orcid":"https://orcid.org/0000-0002-2203-2586"},"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":true,"raw_author_name":"Ravi Kumar","raw_affiliation_strings":["Google, CA"],"affiliations":[{"raw_affiliation_string":"Google, CA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044201440","display_name":"Benjamin Moseley","orcid":"https://orcid.org/0000-0001-8162-017X"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":["Washington University in St. Louis, MO"],"affiliations":[{"raw_affiliation_string":"Washington University in St. Louis, MO","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070795618","display_name":"Sergei Vassilvitskii","orcid":"https://orcid.org/0000-0003-0235-1624"},"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":"Sergei Vassilvitskii","raw_affiliation_strings":["Google, CA"],"affiliations":[{"raw_affiliation_string":"Google, CA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057347957","display_name":"Andrea Vattani","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrea Vattani","raw_affiliation_strings":["University of California at San Diego"],"affiliations":[{"raw_affiliation_string":"University of California at San Diego","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101772779"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":15.6895,"has_fulltext":false,"cited_by_count":135,"citation_normalized_percentile":{"value":0.99331294,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"2","issue":"3","first_page":"1","last_page":"22"},"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.9995999932289124,"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.9995999932289124,"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.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.8742218017578125},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8188080787658691},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7048166990280151},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.5899263024330139},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5848448276519775},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.4879114329814911},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.4811874032020569},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4743719696998596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4305679500102997},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3919706344604492},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21011221408843994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.07402569055557251}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.8742218017578125},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8188080787658691},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7048166990280151},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.5899263024330139},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5848448276519775},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.4879114329814911},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.4811874032020569},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4743719696998596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4305679500102997},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3919706344604492},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21011221408843994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.07402569055557251},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2809814","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2809814","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1881622834","display_name":null,"funder_award_id":"CCF-1016684","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309370","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W112063162","https://openalex.org/W1503396090","https://openalex.org/W1503698146","https://openalex.org/W1535144194","https://openalex.org/W1599161138","https://openalex.org/W1680189815","https://openalex.org/W1965972569","https://openalex.org/W1966923282","https://openalex.org/W1985942708","https://openalex.org/W1991528957","https://openalex.org/W1991635064","https://openalex.org/W1993320088","https://openalex.org/W1995484833","https://openalex.org/W2002379171","https://openalex.org/W2002531683","https://openalex.org/W2020594369","https://openalex.org/W2022013502","https://openalex.org/W2034616054","https://openalex.org/W2036190740","https://openalex.org/W2037594241","https://openalex.org/W2040660972","https://openalex.org/W2045271686","https://openalex.org/W2051109346","https://openalex.org/W2051586153","https://openalex.org/W2060108852","https://openalex.org/W2061820396","https://openalex.org/W2068115726","https://openalex.org/W2074875917","https://openalex.org/W2101246692","https://openalex.org/W2102132526","https://openalex.org/W2104322506","https://openalex.org/W2107917944","https://openalex.org/W2108399535","https://openalex.org/W2108858998","https://openalex.org/W2122465391","https://openalex.org/W2132651631","https://openalex.org/W2141403143","https://openalex.org/W2143996311","https://openalex.org/W2144629587","https://openalex.org/W2144970024","https://openalex.org/W2148239836","https://openalex.org/W2148372359","https://openalex.org/W2152489475","https://openalex.org/W2153977620","https://openalex.org/W2169528473","https://openalex.org/W2170735271","https://openalex.org/W2340149117","https://openalex.org/W2757107770","https://openalex.org/W3101158212","https://openalex.org/W4213060883","https://openalex.org/W6648424669"],"related_works":["https://openalex.org/W4320232260","https://openalex.org/W4252399622","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2357796514","https://openalex.org/W2393014972","https://openalex.org/W2357595179","https://openalex.org/W2351136238","https://openalex.org/W2167807475","https://openalex.org/W2169800510"],"abstract_inverted_index":{"Greedy":[0],"algorithms":[1,22,77,100,128,145],"are":[2,6,8,113],"practitioners\u2019":[3],"best":[4],"friends\u2014they":[5],"intuitive,":[7],"simple":[9],"to":[10,15,42,78,91,116,133,142,150],"implement,":[11],"and":[12,36,87,137],"often":[13],"lead":[14],"very":[16],"good":[17],"solutions.":[18],"However,":[19],"implementing":[20],"greedy":[21,31,76,123],"in":[23,60,103],"a":[24,54,72,104,134],"distributed":[25],"setting":[26],"is":[27,33,38,53],"challenging":[28],"since":[29],"the":[30,46,79,120],"choice":[32],"inherently":[34],"sequential,":[35],"it":[37],"not":[39],"clear":[40],"how":[41],"take":[43],"advantage":[44],"of":[45,62,75,107],"extra":[47],"processing":[48],"power.":[49],"Our":[50,96],"main":[51],"result":[52],"powerful":[55],"sampling":[56],"technique":[57],"that":[58,101,112],"aids":[59],"parallelization":[61],"sequential":[63,122],"algorithms.":[64],"Armed":[65],"with":[66,127],"this":[67,82,140],"primitive,":[68],"we":[69],"then":[70,138],"adapt":[71],"broad":[73],"class":[74,83],"MapReduce":[80],"paradigm;":[81],"includes":[84],"maximum":[85],"cover":[86],"submodular":[88,147],"maximization":[89,131,148],"subject":[90,132,149],"p":[92,153],"-system":[93,154],"constraint":[94,136],"problems.":[95],"method":[97],"yields":[98],"efficient":[99],"run":[102],"logarithmic":[105],"number":[106],"rounds":[108],"while":[109],"obtaining":[110],"solutions":[111],"arbitrarily":[114],"close":[115],"those":[117],"produced":[118],"by":[119],"standard":[121],"algorithm.":[124],"We":[125],"begin":[126],"for":[129,146],"modular":[130],"matroid":[135],"extend":[139],"approach":[141],"obtain":[143],"approximation":[144],"knapsack":[151],"or":[152],"constraints.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":20},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":21},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}