{"id":"https://openalex.org/W7123344236","doi":"https://doi.org/10.1109/cdc57313.2025.11312997","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","display_name":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123344236","doi":"https://doi.org/10.1109/cdc57313.2025.11312997"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312997","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312997","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th 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/A5023787879","display_name":"Joan Vendrell","orcid":"https://orcid.org/0000-0002-3645-8692"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]},{"id":"https://openalex.org/I4210140791","display_name":"Irvine University","ror":"https://ror.org/04ysmca02","country_code":"US","type":"education","lineage":["https://openalex.org/I4210140791"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joan Vendrell","raw_affiliation_strings":["University of California Irvine,Mechanical and Aerospace Engineering Department,Irvine,CA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Irvine,Mechanical and Aerospace Engineering Department,Irvine,CA,USA","institution_ids":["https://openalex.org/I4210140791","https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083575259","display_name":"Alan Kuhnle","orcid":"https://orcid.org/0000-0001-6506-1902"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Kuhnle","raw_affiliation_strings":["The Texas A&M University, Texas,Computer Science and Engineering Department,TX,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Texas A&M University, Texas,Computer Science and Engineering Department,TX,USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5121318962","display_name":"Solmaz S. Kia","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]},{"id":"https://openalex.org/I4210140791","display_name":"Irvine University","ror":"https://ror.org/04ysmca02","country_code":"US","type":"education","lineage":["https://openalex.org/I4210140791"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Solmaz Kia","raw_affiliation_strings":["University of California Irvine,Mechanical and Aerospace Engineering Department,Irvine,CA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Irvine,Mechanical and Aerospace Engineering Department,Irvine,CA,USA","institution_ids":["https://openalex.org/I4210140791","https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.70111207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"6885","last_page":"6890"},"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.6212999820709229,"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.6212999820709229,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.25619998574256897,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.013399999588727951,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.8568000197410583},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7875000238418579},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6646999716758728},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.6121000051498413},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5907999873161316},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5674999952316284},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5663999915122986}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.8568000197410583},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7875000238418579},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6646999716758728},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6151999831199646},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.6121000051498413},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5907999873161316},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5674999952316284},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5663999915122986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.454800009727478},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4392000138759613},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.3887999951839447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37630000710487366},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25619998574256897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312997","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312997","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"Rewired":[3],"Sequential":[4],"Greedy":[5,29,76],"(ResQue":[6],"Greedy),":[7],"an":[8],"enhanced":[9],"approach":[10],"for":[11],"submodular":[12],"maximization":[13],"under":[14],"cardinality":[15],"constraints.":[16],"By":[17],"integrating":[18],"a":[19,25,43],"novel":[20],"set":[21],"curvature":[22],"metric":[23],"within":[24],"lattice-based":[26],"framework,":[27],"ResQue":[28,75],"identifies":[30],"and":[31],"corrects":[32],"suboptimal":[33],"decisions":[34],"made":[35],"by":[36],"the":[37,52,61,83],"standard":[38],"sequential":[39,63,85],"greedy":[40,64,86],"algorithm.":[41],"Specifically,":[42],"curvature-aware":[44],"rewiring":[45],"strategy":[46],"is":[47],"employed":[48],"to":[49,56,82],"dynamically":[50],"redirect":[51],"solution":[53],"path,":[54],"leading":[55],"improved":[57],"approximation":[58],"performance":[59],"over":[60],"conventional":[62],"algorithm":[65],"without":[66],"significantly":[67],"increasing":[68],"computational":[69],"complexity.":[70],"Numerical":[71],"experiments":[72],"demonstrate":[73],"that":[74],"achieves":[77],"tighter":[78],"near-optimality":[79],"bounds":[80],"compared":[81],"traditional":[84],"method.":[87]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-14T00:00:00"}