{"id":"https://openalex.org/W2611972874","doi":"https://doi.org/10.1145/3087556.3087574","title":"Bicriteria Distributed Submodular Maximization in a Few Rounds","display_name":"Bicriteria Distributed Submodular Maximization in a Few Rounds","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2611972874","doi":"https://doi.org/10.1145/3087556.3087574","mag":"2611972874"},"language":"en","primary_location":{"id":"doi:10.1145/3087556.3087574","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3087556.3087574","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3087574&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3087574&type=pdf","any_repository_has_fulltext":null},"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":true,"raw_author_name":"Alessandro Epasto","raw_affiliation_strings":["Google, New York, NY, USA"],"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"],"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/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":"Morteza Zadimoghaddam","raw_affiliation_strings":["Google, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Google, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037972828"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":2.2711,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.89299483,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"33"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9962999820709229,"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.9937999844551086,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.8264369964599609},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.7571063041687012},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7297412157058716},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6597693562507629},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5717411637306213},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5567970871925354},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5288670659065247},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5191692113876343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5177318453788757},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.426133394241333},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40583527088165283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3819383978843689},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3751320242881775},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.18633046746253967}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8264369964599609},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.7571063041687012},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7297412157058716},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6597693562507629},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5717411637306213},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5567970871925354},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5288670659065247},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5191692113876343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5177318453788757},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.426133394241333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40583527088165283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3819383978843689},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3751320242881775},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.18633046746253967},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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/3087556.3087574","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3087556.3087574","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3087574&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3087556.3087574","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3087556.3087574","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3087574&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2611972874.pdf","grobid_xml":"https://content.openalex.org/works/W2611972874.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W168564468","https://openalex.org/W1680189815","https://openalex.org/W1757790940","https://openalex.org/W1997959284","https://openalex.org/W2020594369","https://openalex.org/W2022704179","https://openalex.org/W2037568170","https://openalex.org/W2037757210","https://openalex.org/W2038428842","https://openalex.org/W2053381548","https://openalex.org/W2086337948","https://openalex.org/W2088011174","https://openalex.org/W2101246692","https://openalex.org/W2117659259","https://openalex.org/W2143996311","https://openalex.org/W2144933361","https://openalex.org/W2145607950","https://openalex.org/W2148372359","https://openalex.org/W2151933617","https://openalex.org/W2153977620","https://openalex.org/W2165599843","https://openalex.org/W2170735271","https://openalex.org/W2245821616","https://openalex.org/W2564885518","https://openalex.org/W2952024675","https://openalex.org/W2962908181","https://openalex.org/W3118655244"],"related_works":["https://openalex.org/W2944744777","https://openalex.org/W4321600307","https://openalex.org/W4251076636","https://openalex.org/W1608444752","https://openalex.org/W2950365512","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4299354108","https://openalex.org/W2983019253"],"abstract_inverted_index":{"We":[0,132,183],"study":[1,192],"the":[2,59,101,104,112,140,180,185],"problem":[3,21],"of":[4,37,39,61,66,90,100,103,121,130,142,161,179,193],"efficiently":[5],"optimizing":[6],"submodular":[7],"functions":[8],"under":[9],"cardinality":[10],"constraints":[11],"in":[12,34,50,93,124,168,177,205],"distributed":[13,17,48,74,114,146,151,166],"setting.":[14],"Recently,":[15],"several":[16],"algorithms":[18,49],"for":[19,77,209],"this":[20,69,162],"have":[22,154],"been":[23],"introduced":[24],"which":[25],"either":[26],"achieve":[27],"a":[28,63,73,87,98,135,206],"sub-optimal":[29],"solution":[30],"or":[31],"they":[32],"run":[33],"super-constant":[35],"number":[36,65,129],"rounds":[38,52,208],"computation.":[40],"Unlike":[41],"previous":[42],"work,":[43],"we":[44,71],"aim":[45],"to":[46,149],"design":[47],"multiple":[51],"with":[53,107,188],"almost":[54,199],"optimal":[55],"approximation":[56,119,145],"guarantees":[57,187],"at":[58,155],"cost":[60],"outputting":[62],"larger":[64],"elements.":[67],"Toward":[68],"goal,":[70],"present":[72],"algorithm":[75,115,147,167,195],"that,":[76],"any":[78,83,143],"\u03b5":[79],">":[80],"0":[81],"and":[82,96],"constant":[84],"r,":[85],"outputs":[86],"set":[88,106],"S":[89],"O(rk/\u03b51/r)":[91],"items":[92],"r":[94,171],"rounds,":[95],"achieves":[97,117],"(1-\u03b5)-approximation":[99],"value":[102],"optimum":[105,200],"k":[108],"items.":[109,158],"This":[110],"is":[111,174,202],"first":[113],"that":[116,139,197],"an":[118,189],"factor":[120],"(1-\u03b5)":[122],"running":[123],"less":[125],"than":[126],"log":[127],"1/\u03b5":[128],"rounds.":[131],"also":[133],"prove":[134],"hardness":[136,163],"result":[137],"showing":[138,196],"output":[141,181],"1-\u03b5":[144],"limited":[148],"one":[150,169],"round":[152],"should":[153],"least":[156],"\u03a9(k/\u03b5)":[157],"In":[159],"light":[160],"result,":[164],"our":[165,194],"round,":[170],"=":[172],"1,":[173],"asymptotically":[175],"tight":[176],"terms":[178],"size.":[182],"support":[184],"theoretical":[186],"extensive":[190],"empirical":[191],"achieving":[198],"solutions":[201],"indeed":[203],"possible":[204],"few":[207],"large-scale":[210],"real":[211],"datasets.":[212]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}