{"id":"https://openalex.org/W3012445388","doi":"https://doi.org/10.1109/cdc40024.2019.9029639","title":"Robust Maximization of Correlated Submodular Functions","display_name":"Robust Maximization of Correlated Submodular Functions","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3012445388","doi":"https://doi.org/10.1109/cdc40024.2019.9029639","mag":"3012445388"},"language":"en","primary_location":{"id":"doi:10.1109/cdc40024.2019.9029639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029639","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/A5036206411","display_name":"Qiqiang Hou","orcid":"https://orcid.org/0000-0003-2081-7467"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Qiqiang Hou","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA, USA","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004774385","display_name":"Andrew Clark","orcid":"https://orcid.org/0000-0002-5868-6186"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Clark","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA, USA","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036206411"],"corresponding_institution_ids":["https://openalex.org/I107077323"],"apc_list":null,"apc_paid":null,"fwci":0.194,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58038944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"84","issue":null,"first_page":"7177","last_page":"7183"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9854000210762024,"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.9853000044822693,"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.9833741784095764},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6946573853492737},{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.6374599933624268},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6051729917526245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.570847749710083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5058560371398926},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4823319613933563},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41966259479522705},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.411429762840271},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.184154212474823},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1428224742412567}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9833741784095764},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6946573853492737},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.6374599933624268},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6051729917526245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.570847749710083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5058560371398926},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4823319613933563},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41966259479522705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.411429762840271},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.184154212474823},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1428224742412567},{"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.1109/cdc40024.2019.9029639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029639","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":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W301805053","https://openalex.org/W1875482710","https://openalex.org/W2109209963","https://openalex.org/W2119186364","https://openalex.org/W2138624490","https://openalex.org/W2141403143","https://openalex.org/W2156602393","https://openalex.org/W2166295994","https://openalex.org/W2472207966","https://openalex.org/W2549654239","https://openalex.org/W2611972874","https://openalex.org/W2734772652","https://openalex.org/W2741807132","https://openalex.org/W2768060570","https://openalex.org/W2783692201","https://openalex.org/W2963300745","https://openalex.org/W2963554371","https://openalex.org/W2964175192","https://openalex.org/W4247555059","https://openalex.org/W4293570150","https://openalex.org/W4293743321","https://openalex.org/W6610558371","https://openalex.org/W6631084031","https://openalex.org/W6639467292","https://openalex.org/W6676811314","https://openalex.org/W6677868604","https://openalex.org/W6683345173","https://openalex.org/W6720222040","https://openalex.org/W6729344810","https://openalex.org/W6729861744","https://openalex.org/W6742188047","https://openalex.org/W6748007277"],"related_works":["https://openalex.org/W2963844234","https://openalex.org/W2803250016","https://openalex.org/W2896347948","https://openalex.org/W2402949237","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2594118609","https://openalex.org/W2765425000","https://openalex.org/W3204684126"],"abstract_inverted_index":{"Submodular":[0],"maximization":[1,62],"has":[2,50],"applications":[3],"in":[4],"networked":[5],"control,":[6],"data":[7],"summarization,":[8],"and":[9,115],"path":[10],"planning,":[11],"among":[12],"other":[13],"areas.":[14],"While":[15],"several":[16],"efficient":[17],"algorithms":[18],"with":[19],"provable":[20,101],"optimality":[21,102],"bounds":[22,117],"have":[23],"been":[24],"developed":[25],"for":[26],"maximizing":[27,38],"a":[28,42,81,89,100,105],"single":[29],"submodular":[30,45,48,61],"function,":[31],"the":[32,39,64,70,95,119,123],"more":[33],"computationally":[34],"challenging":[35],"problem":[36],"of":[37,41,44,73,84,111],"minimum":[40],"set":[43],"functions":[46,66],"(robust":[47],"maximization)":[49],"received":[51],"less":[52],"research":[53],"attention.":[54],"In":[55],"this":[56],"paper,":[57],"we":[58,108],"investigate":[59],"robust":[60],"when":[63],"objective":[65],"are":[67,79,128],"correlated,":[68],"i.e.,":[69],"marginal":[71],"benefits":[72],"adding":[74],"elements":[75],"to":[76,98],"each":[77,85],"function":[78],"within":[80],"given":[82],"ratio":[83,97,121],"other.":[86],"We":[87],"propose":[88],"modified":[90],"greedy":[91],"algorithm":[92],"that":[93],"exploits":[94],"correlation":[96,120],"achieve":[99],"bound.":[103],"As":[104],"case":[106],"study,":[107],"consider":[109],"minimization":[110],"graph":[112,124],"effective":[113],"resistance,":[114],"derive":[116],"on":[118],"using":[122],"spectrum.":[125],"Our":[126],"results":[127],"evaluated":[129],"through":[130],"numerical":[131],"study.":[132]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}