{"id":"https://openalex.org/W2904277588","doi":"https://doi.org/10.1109/cdc.2018.8618958","title":"Distributed Submodular Minimization Over Networks: A Greedy Column Generation Approach","display_name":"Distributed Submodular Minimization Over Networks: A Greedy Column Generation Approach","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2904277588","doi":"https://doi.org/10.1109/cdc.2018.8618958","mag":"2904277588"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2018.8618958","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8618958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8618958&isnumber=8618647","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005195312","display_name":"Andrea Testa","orcid":"https://orcid.org/0000-0002-8118-5320"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea Testa","raw_affiliation_strings":["Department of Engineering, Universita del Salento, Leece, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Engineering, Universita del Salento, Leece, Italy","institution_ids":["https://openalex.org/I142910587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007708568","display_name":"Ivano Notarnicola","orcid":"https://orcid.org/0000-0002-9841-3684"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Ivano Notarnicola","raw_affiliation_strings":["Department of Engineering, Universita del Salento, Leece, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Engineering, Universita del Salento, Leece, Italy","institution_ids":["https://openalex.org/I142910587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017893179","display_name":"Giuseppe Notarstefano","orcid":"https://orcid.org/0000-0002-0906-7848"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuseppe Notarstefano","raw_affiliation_strings":["Department of Electrical, Electronic and Information Engineering, University of Bologna, Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Electrical, Electronic and Information Engineering, University of Bologna, Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005195312"],"corresponding_institution_ids":["https://openalex.org/I142910587"],"apc_list":null,"apc_paid":null,"fwci":0.6058,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71845162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4945","last_page":"4950"},"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.9908999800682068,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9886000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9377999901771545},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6257650852203369},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5980900526046753},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.5771797895431519},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4772243797779083},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4643685221672058},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.43464338779449463},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.42511966824531555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40655753016471863},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.35309311747550964}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9377999901771545},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6257650852203369},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5980900526046753},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5771797895431519},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4772243797779083},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4643685221672058},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.43464338779449463},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.42511966824531555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40655753016471863},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35309311747550964},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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":2,"locations":[{"id":"doi:10.1109/cdc.2018.8618958","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8618958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:cris.unibo.it:11585/674736","is_oa":true,"landing_page_url":"http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8618958&isnumber=8618647","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:cris.unibo.it:11585/674736","is_oa":true,"landing_page_url":"http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8618958&isnumber=8618647","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W389907844","https://openalex.org/W1030012168","https://openalex.org/W1563601717","https://openalex.org/W1576820654","https://openalex.org/W1912128066","https://openalex.org/W1938602245","https://openalex.org/W1974480136","https://openalex.org/W2042914239","https://openalex.org/W2050844088","https://openalex.org/W2086058123","https://openalex.org/W2088448814","https://openalex.org/W2105560970","https://openalex.org/W2110538410","https://openalex.org/W2118544668","https://openalex.org/W2118936174","https://openalex.org/W2134220221","https://openalex.org/W2593885706","https://openalex.org/W2739335553","https://openalex.org/W2747182455","https://openalex.org/W2759474254","https://openalex.org/W2768060570","https://openalex.org/W2783692201","https://openalex.org/W2952019053","https://openalex.org/W2953028742","https://openalex.org/W2963300745","https://openalex.org/W2963313287","https://openalex.org/W2964202295","https://openalex.org/W4285719527","https://openalex.org/W4297805498","https://openalex.org/W6639808567","https://openalex.org/W6643579956","https://openalex.org/W6677550685","https://openalex.org/W6677887347","https://openalex.org/W6679884957","https://openalex.org/W6679946015","https://openalex.org/W6722906699"],"related_works":["https://openalex.org/W3047700137","https://openalex.org/W2962866360","https://openalex.org/W2402949237","https://openalex.org/W2594118609","https://openalex.org/W2951839510","https://openalex.org/W2765425000","https://openalex.org/W1497312391","https://openalex.org/W3204684126","https://openalex.org/W2735578456","https://openalex.org/W2765086890"],"abstract_inverted_index":{"Submodular":[0],"optimization":[1,8],"is":[2,52,58,68,130,142],"a":[3,46,81,86,99,108,117,148],"special":[4],"class":[5],"of":[6,20,91,126,140,168,185],"combinatorial":[7,93],"arising":[9],"in":[10,17,29,45,103,161],"several":[11],"machine":[12],"learning":[13],"problems,":[14],"but":[15],"also":[16],"cooperative":[18],"control":[19],"complex":[21],"systems.":[22],"In":[23],"this":[24],"paper,":[25],"we":[26,174],"consider":[27],"agents":[28,146],"an":[30,137,165],"asynchronous,":[31],"unreliable":[32],"and":[33,112,173],"time-varying":[34],"directed":[35],"network":[36],"that":[37,53,64,131,155],"aim":[38],"at":[39],"cooperatively":[40],"solving":[41],"submodular":[42,170],"minimization":[43,171],"problems":[44],"fully":[47],"distributed":[48,82,158],"way.":[49],"The":[50],"challenge":[51],"the":[54,72,92,127,132,145,156,169,176,186],"(submodular)":[55],"objective":[56],"set-function":[57],"only":[59,74],"partially":[60],"known":[61],"by":[62,144,179],"agents,":[63],"is,":[65],"each":[66,105],"one":[67],"able":[69],"to":[70,164],"evaluate":[71],"function":[73],"for":[75],"subsets":[76],"including":[77],"itself.":[78],"We":[79,153],"propose":[80],"algorithm":[83,96,129,159],"based":[84],"on":[85,98,183],"proper":[87],"linear":[88],"programming":[89],"reformulation":[90],"problem.":[94,191],"Our":[95],"builds":[97],"column":[100],"generation":[101],"approach":[102],"which":[104,135],"agent":[106],"maintains":[107],"local":[109],"candidate":[110],"basis":[111],"locally":[113],"generates":[114],"columns":[115],"with":[116],"suitable":[118],"greedy":[119,151],"inner":[120],"routine.":[121],"A":[122],"key":[123],"interesting":[124],"feature":[125],"proposed":[128,157],"pricing":[133],"problem,":[134],"involves":[136],"exponential":[138],"number":[139],"constraints,":[141],"solved":[143],"through":[147],"polynomial":[149],"time":[150,163],"algorithm.":[152],"prove":[154],"converges":[160],"finite":[162],"optimal":[166],"solution":[167],"problem":[172],"corroborate":[175],"theoretical":[177],"results":[178],"performing":[180],"numerical":[181],"computations":[182],"instances":[184],"s-t":[187],"minimum":[188],"graph":[189],"cut":[190]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}