{"id":"https://openalex.org/W3010909727","doi":"https://doi.org/10.1109/cdc40024.2019.9029710","title":"Distributed Submodular Maximization with Bounded Communication Cost","display_name":"Distributed Submodular Maximization with Bounded Communication Cost","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3010909727","doi":"https://doi.org/10.1109/cdc40024.2019.9029710","mag":"3010909727"},"language":"en","primary_location":{"id":"doi:10.1109/cdc40024.2019.9029710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","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/A5055493698","display_name":"Timothy Castiglia","orcid":"https://orcid.org/0000-0003-3432-935X"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Timothy Castiglia","raw_affiliation_strings":["Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081738999","display_name":"Stacy Patterson","orcid":"https://orcid.org/0000-0001-7711-6018"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stacy Patterson","raw_affiliation_strings":["Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055493698"],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":0.194,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57887243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":null,"first_page":"3006","last_page":"3011"},"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.996999979019165,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9965999722480774,"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.8624595999717712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7217496633529663},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.6075169444084167},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.581278920173645},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5747789144515991},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4923955202102661},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4633761942386627},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4481930136680603},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33795636892318726},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3040667176246643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2965034544467926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2095286250114441}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8624595999717712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7217496633529663},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6075169444084167},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.581278920173645},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5747789144515991},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4923955202102661},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4633761942386627},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4481930136680603},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33795636892318726},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3040667176246643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2965034544467926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2095286250114441},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc40024.2019.9029710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","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":21,"referenced_works":["https://openalex.org/W301805053","https://openalex.org/W1517928915","https://openalex.org/W1601503375","https://openalex.org/W1680189815","https://openalex.org/W1982571886","https://openalex.org/W1985123706","https://openalex.org/W2017927472","https://openalex.org/W2099901267","https://openalex.org/W2104734478","https://openalex.org/W2114085163","https://openalex.org/W2117412539","https://openalex.org/W2137560895","https://openalex.org/W2401610261","https://openalex.org/W2747182455","https://openalex.org/W2783692201","https://openalex.org/W2913321117","https://openalex.org/W2915041254","https://openalex.org/W3166880264","https://openalex.org/W6610558371","https://openalex.org/W6631046737","https://openalex.org/W6747947949"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4313343266"],"abstract_inverted_index":{"We":[0,95,105,132],"study":[1],"distributed":[2,13,146],"submodular":[3,35],"maximization":[4,14],"in":[5,61,148],"networks":[6],"with":[7],"heterogeneous":[8],"communication":[9,89,119],"costs.":[10],"In":[11,66],"the":[12,28,56,59,71,79,87,92,117,139,145,157],"algorithm,":[15],"each":[16],"agent":[17],"selects":[18],"a":[19,22,33,75,84,134],"strategy":[20],"from":[21],"discrete":[23],"set":[24],"of":[25,58,63,73,91,159],"options,":[26],"and":[27,48],"objective":[29],"is":[30,103],"to":[31,83],"maximize":[32],"global":[34],"function":[36],"over":[37],"these":[38],"strategies.":[39],"The":[40],"network":[41,76,100],"topology":[42],"imposes":[43],"limitations":[44],"on":[45,55,86],"information":[46,130,141],"sharing,":[47],"several":[49],"recent":[50],"works":[51],"have":[52],"derived":[53],"bounds":[54],"performance":[57,81,158],"algorithm":[60,80,93,110,118,136,147],"terms":[62],"graph":[64],"properties.":[65],"this":[67,99],"work,":[68],"we":[69,114,152],"consider":[70],"problem":[72,102],"designing":[74],"that":[77,98,116,137],"maximizes":[78],"subject":[82],"bound":[85],"total":[88],"cost":[90,120],"execution.":[94],"first":[96],"prove":[97],"design":[101],"NP-hard.":[104],"then":[106],"present":[107,153],"an":[108],"approximation":[109],"for":[111,129,144],"it.":[112],"Next,":[113],"show":[115],"can":[121],"be":[122],"further":[123],"reduced":[124],"by":[125],"using":[126],"multi-hop":[127],"routing":[128],"propagation.":[131],"give":[133],"polynomial-time":[135],"finds":[138],"optimal":[140],"propagation":[142],"scheme":[143],"edge-weighted":[149],"networks.":[150],"Finally,":[151],"experimental":[154],"results":[155],"highlighting":[156],"our":[160],"algorithms.":[161]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}