{"id":"https://openalex.org/W3035181444","doi":"https://doi.org/10.1145/3357713.3384286","title":"The one-way communication complexity of submodular maximization with applications to streaming and robustness","display_name":"The one-way communication complexity of submodular maximization with applications to streaming and robustness","publication_year":2020,"publication_date":"2020-06-22","ids":{"openalex":"https://openalex.org/W3035181444","doi":"https://doi.org/10.1145/3357713.3384286","mag":"3035181444"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384286","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384286","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384286","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384286","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077772086","display_name":"Moran Feldman","orcid":"https://orcid.org/0000-0002-1535-2979"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Moran Feldman","raw_affiliation_strings":["University of Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005843027","display_name":"Ashkan Norouzi-Fard","orcid":"https://orcid.org/0000-0002-2336-9826"},"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":"Ashkan Norouzi-Fard","raw_affiliation_strings":["Google Research, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5077772086"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":null,"apc_paid":null,"fwci":3.6438,"has_fulltext":true,"cited_by_count":32,"citation_normalized_percentile":{"value":0.94246858,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1363","last_page":"1374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10237","display_name":"Cryptography and Data Security","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8789329528808594},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7655781507492065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6969315409660339},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6357704997062683},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.6088464260101318},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5913292169570923},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5264369249343872},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4927234947681427},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48598894476890564},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4816514551639557},{"id":"https://openalex.org/keywords/models-of-communication","display_name":"Models of communication","score":0.44766002893447876},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4300905466079712},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4237537384033203},{"id":"https://openalex.org/keywords/utility-maximization-problem","display_name":"Utility maximization problem","score":0.42288652062416077},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2259882688522339},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.22273927927017212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21768993139266968},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21523171663284302},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1026071310043335}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8789329528808594},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7655781507492065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6969315409660339},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6357704997062683},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.6088464260101318},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5913292169570923},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5264369249343872},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4927234947681427},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48598894476890564},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4816514551639557},{"id":"https://openalex.org/C158156997","wikidata":"https://www.wikidata.org/wiki/Q1416645","display_name":"Models of communication","level":2,"score":0.44766002893447876},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4300905466079712},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4237537384033203},{"id":"https://openalex.org/C2779044140","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization problem","level":3,"score":0.42288652062416077},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2259882688522339},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.22273927927017212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21768993139266968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21523171663284302},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1026071310043335},{"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/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C46312422","wikidata":"https://www.wikidata.org/wiki/Q11024","display_name":"Communication","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3357713.3384286","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384286","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384286","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:284405","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/284405","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"conference proceedings"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384286","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384286","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384286","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.550000011920929,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G2514869301","display_name":null,"funder_award_id":"200021_184622 and 200021_165866","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G3052677248","display_name":null,"funder_award_id":"200021-184656","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G3113807307","display_name":"Fundamental Problems at the Interface of Combinatorial Optimization with Integer Programming and Online Optimization","funder_award_id":"817750","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4453603538","display_name":null,"funder_award_id":"817750","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G4915951725","display_name":"Randomness in Problem Instances and Randomized Algorithms","funder_award_id":"184656","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G5256785375","display_name":null,"funder_award_id":"200021-","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G5926618553","display_name":null,"funder_award_id":"200021_165866","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G7746946551","display_name":null,"funder_award_id":"1357/16","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G83575632","display_name":null,"funder_award_id":"200021_184622","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G993971353","display_name":null,"funder_award_id":"200021","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3035181444.pdf","grobid_xml":"https://content.openalex.org/works/W3035181444.grobid-xml"},"referenced_works_count":60,"referenced_works":["https://openalex.org/W1595640791","https://openalex.org/W1680189815","https://openalex.org/W1875482710","https://openalex.org/W1997783781","https://openalex.org/W1997959284","https://openalex.org/W2037568170","https://openalex.org/W2099829673","https://openalex.org/W2110896443","https://openalex.org/W2132651631","https://openalex.org/W2135625292","https://openalex.org/W2137090699","https://openalex.org/W2137416782","https://openalex.org/W2140641199","https://openalex.org/W2156672682","https://openalex.org/W2170168647","https://openalex.org/W2251656679","https://openalex.org/W2402745737","https://openalex.org/W2480626043","https://openalex.org/W2560674852","https://openalex.org/W2624915851","https://openalex.org/W2753131022","https://openalex.org/W2788127768","https://openalex.org/W2796716148","https://openalex.org/W2797074460","https://openalex.org/W2804373447","https://openalex.org/W2804439311","https://openalex.org/W2809318113","https://openalex.org/W2883816296","https://openalex.org/W2884838154","https://openalex.org/W2890524378","https://openalex.org/W2895443120","https://openalex.org/W2943462113","https://openalex.org/W2951667883","https://openalex.org/W2952024675","https://openalex.org/W2952359104","https://openalex.org/W2952567852","https://openalex.org/W2953028742","https://openalex.org/W2953374984","https://openalex.org/W2962795549","https://openalex.org/W2962907715","https://openalex.org/W2962908181","https://openalex.org/W2963115142","https://openalex.org/W2963268806","https://openalex.org/W2963298316","https://openalex.org/W2963548184","https://openalex.org/W2963829849","https://openalex.org/W2965904208","https://openalex.org/W2988480584","https://openalex.org/W3006656045","https://openalex.org/W3008516270","https://openalex.org/W3013599369","https://openalex.org/W3038050179","https://openalex.org/W4247950230","https://openalex.org/W4287822890","https://openalex.org/W4297823791","https://openalex.org/W4298086162","https://openalex.org/W4299828299","https://openalex.org/W4389615669","https://openalex.org/W6754550681","https://openalex.org/W6754838541"],"related_works":["https://openalex.org/W2788127768","https://openalex.org/W2963443186","https://openalex.org/W4382197677","https://openalex.org/W3128830699","https://openalex.org/W4299680505","https://openalex.org/W2626995008","https://openalex.org/W2964165521","https://openalex.org/W4301403455","https://openalex.org/W4318812107","https://openalex.org/W4296167783"],"abstract_inverted_index":{"We":[0,30,81],"consider":[1,31],"the":[2,39,48,57,78,94,101],"classical":[3],"problem":[4],"of":[5,50,65],"maximizing":[6],"a":[7,13,32,62],"monotone":[8],"submodular":[9],"function":[10],"subject":[11],"to":[12,18,93],"cardinality":[14],"constraint,":[15],"which,":[16,91],"due":[17,92],"its":[19],"numerous":[20],"applications,":[21],"has":[22],"recently":[23],"been":[24],"studied":[25],"in":[26,68,100],"various":[27],"computational":[28],"models.":[29],"clean":[33],"multi-player":[34],"model":[35,55],"that":[36],"lies":[37],"between":[38],"offline":[40],"and":[41,44,104],"streaming":[42,58],"model,":[43,90],"study":[45],"it":[46,75],"under":[47],"aspect":[49],"one-way":[51,84],"communication":[52,85],"complexity.":[53],"Our":[54],"captures":[56],"setting":[59],"(by":[60],"considering":[61],"large":[63],"number":[64],"players),":[66],"and,":[67],"addition,":[69],"two":[70],"player":[71],"approximation":[72],"results":[73,87],"for":[74,88],"translate":[76],"into":[77],"robust":[79,105],"setting.":[80,106],"present":[82],"tight":[83],"complexity":[86],"our":[89],"above-mentioned":[95],"connections,":[96],"have":[97],"multiple":[98],"implications":[99],"data":[102],"stream":[103]},"counts_by_year":[{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-23T08:51:43.019350","created_date":"2025-10-10T00:00:00"}