{"id":"https://openalex.org/W2807926398","doi":"https://doi.org/10.1145/3210377.3210386","title":"Greedy and Local Ratio Algorithms in the MapReduce Model","display_name":"Greedy and Local Ratio Algorithms in the MapReduce Model","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2807926398","doi":"https://doi.org/10.1145/3210377.3210386","mag":"2807926398"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210386","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5102957872","display_name":"Nicholas J. A. Harvey","orcid":"https://orcid.org/0000-0001-5593-9785"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Nicholas J. A. Harvey","raw_affiliation_strings":["University of British Columbia, Vancouver, BC, Canada"],"affiliations":[{"raw_affiliation_string":"University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076085270","display_name":"Christopher Liaw","orcid":"https://orcid.org/0000-0001-5373-9229"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Christopher Liaw","raw_affiliation_strings":["University of British Columbia, Vancouver, BC, Canada"],"affiliations":[{"raw_affiliation_string":"University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101725949","display_name":"Paul Liu","orcid":"https://orcid.org/0000-0002-9386-6609"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul Liu","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102957872"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":5.3328,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.96383363,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"25","issue":null,"first_page":"43","last_page":"52"},"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.9998999834060669,"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.9998999834060669,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9976999759674072,"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.9962999820709229,"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/submodular-set-function","display_name":"Submodular set function","score":0.7890113592147827},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.7686334848403931},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6510108709335327},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6402601003646851},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5802017450332642},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5624123811721802},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5301231741905212},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.47095566987991333},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4649321734905243},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4629477262496948},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45892953872680664},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4526594877243042},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45247355103492737},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.4377746880054474},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.4262579083442688},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4143521189689636},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3866390585899353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3390238583087921},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3075416088104248},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3027271628379822},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1258251667022705}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7890113592147827},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.7686334848403931},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6510108709335327},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6402601003646851},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5802017450332642},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5624123811721802},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5301231741905212},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.47095566987991333},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4649321734905243},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4629477262496948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45892953872680664},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4526594877243042},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45247355103492737},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.4377746880054474},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.4262579083442688},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4143521189689636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3866390585899353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3390238583087921},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3075416088104248},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3027271628379822},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1258251667022705},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210377.3210386","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on 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":43,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1572977974","https://openalex.org/W1736726159","https://openalex.org/W1823044884","https://openalex.org/W1970592111","https://openalex.org/W1974040526","https://openalex.org/W1988837529","https://openalex.org/W2008199814","https://openalex.org/W2029828838","https://openalex.org/W2032146159","https://openalex.org/W2037568170","https://openalex.org/W2039797405","https://openalex.org/W2044914352","https://openalex.org/W2045271686","https://openalex.org/W2051586153","https://openalex.org/W2074875917","https://openalex.org/W2100061495","https://openalex.org/W2107600509","https://openalex.org/W2111708605","https://openalex.org/W2118288908","https://openalex.org/W2140030920","https://openalex.org/W2144335278","https://openalex.org/W2144970024","https://openalex.org/W2153977620","https://openalex.org/W2157054705","https://openalex.org/W2177862760","https://openalex.org/W2188731843","https://openalex.org/W2242407666","https://openalex.org/W2275325805","https://openalex.org/W2497212938","https://openalex.org/W2549654239","https://openalex.org/W2568420557","https://openalex.org/W2576335674","https://openalex.org/W2611804663","https://openalex.org/W2619776170","https://openalex.org/W2626928698","https://openalex.org/W2739409954","https://openalex.org/W2767578875","https://openalex.org/W2912724389","https://openalex.org/W2914876264","https://openalex.org/W2953312118","https://openalex.org/W2962908181","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W4247100793","https://openalex.org/W2063671489","https://openalex.org/W2047424666","https://openalex.org/W2116388786","https://openalex.org/W2551034790","https://openalex.org/W1966805076","https://openalex.org/W1508327628","https://openalex.org/W2012700732"],"abstract_inverted_index":{"MapReduce":[0,27,79],"has":[1,20],"become":[2],"the":[3],"de":[4],"facto":[5],"standard":[6],"model":[7],"for":[8,29,41,58,69,87,97,106],"designing":[9,25,42],"distributed":[10],"algorithms":[11,28,47,86,105],"to":[12],"process":[13],"big":[14],"data":[15],"on":[16,24],"a":[17,75,94],"cluster.":[18],"There":[19],"been":[21],"considerable":[22],"research":[23],"efficient":[26],"clustering,":[30],"graph":[31],"optimization,":[32],"and":[33,44,62,65,93,112],"submodular":[34],"optimization":[35],"problems.":[36],"We":[37,101],"develop":[38],"new":[39],"techniques":[40],"greedy":[43,83,104],"local":[45,53],"ratio":[46,54],"in":[48,74],"this":[49],"setting.":[50],"Our":[51,81],"randomized":[52,82],"technique":[55,84],"gives":[56,85],"$2$-approximations":[57],"weighted":[59,63,70,98],"vertex":[60,107],"cover":[61],"matching,":[64],"an":[66],"f":[67],"-approximation":[68],"set":[71,99],"cover,":[72],"all":[73],"constant":[76],"number":[77],"of":[78],"rounds.":[80],"maximal":[88,91],"independent":[89],"set,":[90],"clique,":[92],"(1+\u03b5)1n":[95],"\u0394-approximation":[96],"cover.":[100],"also":[102],"give":[103],"colouring":[108,114],"with":[109,115],"$(1+o(1))\u0394":[110],"colours":[111],"edge":[113],"(1+o(1))\u0394":[116],"colours.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}