{"id":"https://openalex.org/W7164134036","doi":"https://doi.org/10.48550/arxiv.2606.10192","title":"Submodular Optimization with Applications to Decision and Control","display_name":"Submodular Optimization with Applications to Decision and Control","publication_year":2026,"publication_date":"2026-06-08","ids":{"openalex":"https://openalex.org/W7164134036","doi":"https://doi.org/10.48550/arxiv.2606.10192"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.10192","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.10192","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.10192","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138372841","display_name":"Shamak Dutta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dutta, Shamak","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022064746","display_name":"Bahman Gharesifard","orcid":"https://orcid.org/0000-0003-1495-3489"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gharesifard, Bahman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138376411","display_name":"Stephen L. Smith","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Smith, Stephen L.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.46970000863075256,"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.46970000863075256,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.09719999879598618,"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"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.08240000158548355,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.984499990940094},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.635200023651123},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.527899980545044},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47859999537467957},{"id":"https://openalex.org/keywords/observability","display_name":"Observability","score":0.4196000099182129},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.40049999952316284},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.36419999599456787},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.3634999990463257}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.984499990940094},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.635200023651123},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.527899980545044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5227000117301941},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5202999711036682},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47859999537467957},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.40049999952316284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3790000081062317},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36419999599456787},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.3634999990463257},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.35760000348091125},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.3522999882698059},{"id":"https://openalex.org/C157286648","wikidata":"https://www.wikidata.org/wiki/Q846780","display_name":"Kalman filter","level":2,"score":0.3416999876499176},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.32339999079704285},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3075999915599823},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C48209547","wikidata":"https://www.wikidata.org/wiki/Q1331104","display_name":"Controllability","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.10192","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.10192","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.10192","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.10192","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Submodular":[0],"set":[1],"functions,":[2,82],"characterized":[3],"by":[4],"the":[5,28,54,60,77,86,89,101,160,180,184,187,209,215,221],"diminishing-returns":[6],"property,":[7],"provide":[8],"a":[9,69],"unifying":[10],"combinatorial":[11],"framework":[12],"for":[13,43,105],"many":[14],"subset-selection":[15],"problems":[16],"in":[17,26,94],"decision":[18],"and":[19,63,73,85,98,100,107,115,143,154,159,177,183,208],"control.":[20,74],"Although":[21],"exact":[22],"maximization":[23],"is":[24],"NP-hard":[25],"general,":[27],"structural":[29,78],"properties":[30,79],"of":[31,65,80,179,186],"submodular":[32,66,81,109,128,133,174],"functions":[33],"enable":[34],"simple":[35],"greedy":[36],"algorithms":[37,104,153],"that":[38,92,225],"achieve":[39],"constant-factor":[40],"approximation":[41,103,113],"guarantees":[42,52],"monotone":[44,106],"objectives,":[45],"with":[46,68,111,165],"randomized":[47],"greedy-based":[48,152],"variants":[49],"extending":[50],"such":[51],"to":[53,197],"non-monotone":[55,108],"case.":[56],"This":[57],"survey":[58,120,148],"reviews":[59],"theory,":[61,136,138],"algorithms,":[62],"applications":[64,121],"optimization":[67],"focus":[70],"on":[71,167],"systems":[72],"We":[75,118,163,218],"cover":[76],"including":[83],"curvature":[84,158],"submodularity":[87,161],"ratio,":[88],"constraint":[90],"families":[91],"arise":[93],"practice":[95],"(matroids,":[96],"knapsack,":[97],"$p$-systems),":[99],"main":[102],"maximization,":[110],"up-to-date":[112],"ratios":[114],"hardness":[116],"results.":[117],"then":[119],"across":[122],"sensor":[123],"scheduling,":[124],"multi-agent":[125],"coordination,":[126],"robust":[127],"optimization,":[129,134],"leader-follower":[130],"systems,":[131],"distributed":[132],"game":[135],"system":[137],"resource":[139],"allocation,":[140],"social":[141],"networks,":[142],"informative":[144],"path":[145],"planning.":[146],"The":[147],"emphasizes":[149],"practically":[150],"implementable":[151],"instance-dependent":[155],"refinements":[156],"via":[157],"ratio.":[162],"close":[164],"observations":[166],"canonical":[168],"control-theoretic":[169],"objectives:":[170],"certain":[171],"functionals":[172],"are":[173],"(the":[175,202],"log-determinant":[176,185],"rank":[178],"controllability":[181],"Gramian,":[182],"Kalman":[188,204],"filter":[189,205],"information":[190],"matrix),":[191],"whereas":[192],"closely":[193],"related":[194],"objectives":[195],"fail":[196],"be":[198],"sub-":[199],"or":[200],"supermodular":[201],"steady-state":[203],"error":[206],"covariance,":[207],"average":[210],"control":[211],"energy":[212],"obtained":[213],"from":[214],"inverse":[216],"Gramian).":[217],"also":[219],"highlight":[220],"cross-cutting":[222],"open":[223],"directions":[224],"follow.":[226]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-11T00:00:00"}