{"id":"https://openalex.org/W7212007500","doi":"https://doi.org/10.48550/arxiv.2609.07787","title":"The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids","display_name":"The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids","publication_year":2026,"publication_date":"2026-09-07","ids":{"openalex":"https://openalex.org/W7212007500","doi":"https://doi.org/10.48550/arxiv.2609.07787"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.07787","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.07787","pdf_url":"https://arxiv.org/pdf/2609.07787","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.07787","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119932375","display_name":"Joan Vendrell Gallart","orcid":"https://orcid.org/0000-0002-3645-8692","observed_orcids":["https://orcid.org/0000-0002-3645-8692"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gallart, Joan Vendrell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088880250","display_name":"Russell W. Bent","orcid":"https://orcid.org/0000-0002-7300-151X","observed_orcids":["https://orcid.org/0000-0002-7300-151X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bent, Russell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5049439078","display_name":"Solmaz S. Kia","orcid":"https://orcid.org/0000-0002-8492-6913","observed_orcids":["https://orcid.org/0000-0002-8492-6913"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kia, Solmaz","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":true,"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.9868000149726868,"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.9868000149726868,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0012000000569969416,"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/T10454","display_name":"Optimal Power Flow Distribution","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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-approximation","display_name":"greedy approximation","score":0.6110000014305115},{"id":"https://openalex.org/keywords/greedoids","display_name":"greedoids","score":0.8489999771118164},{"id":"https://openalex.org/keywords/feasibility-constraints","display_name":"feasibility constraints","score":0.5920000076293945},{"id":"https://openalex.org/keywords/approximation-bounds","display_name":"approximation bounds","score":0.6859999895095825},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7889999747276306}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6812999844551086},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6225000023841858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6154999732971191},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6014000177383423},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5792999863624573},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5587999820709229},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5306000113487244},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5001000165939331},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4756999909877777},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43160000443458557},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.42579999566078186},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4171000123023987},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.3912000060081482},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.38670000433921814},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.3862000107765198},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.36800000071525574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30720001459121704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29089999198913574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2784999907016754},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.267300009727478},{"id":"https://openalex.org/C134121241","wikidata":"https://www.wikidata.org/wiki/Q899301","display_name":"Yield (engineering)","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25929999351501465},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.07787","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.07787","pdf_url":"https://arxiv.org/pdf/2609.07787","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.07787","doi":"https://doi.org/10.48550/arxiv.2609.07787","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.07787","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,"listed_in":[],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.07787","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.07787","pdf_url":"https://arxiv.org/pdf/2609.07787","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7212007500.pdf","grobid_xml":"https://content.openalex.org/works/W7212007500.grobid-xml"},"referenced_works_count":3,"referenced_works":["https://openalex.org/W2767913075","https://openalex.org/W4417116225","https://openalex.org/W7104275976"],"related_works":["https://openalex.org/W7032869384","https://openalex.org/W2364130305","https://openalex.org/W2252172643","https://openalex.org/W2968068505","https://openalex.org/W7096038907","https://openalex.org/W2969097685","https://openalex.org/W2784785544","https://openalex.org/W4309089047","https://openalex.org/W1971161781","https://openalex.org/W2514846057"],"abstract_inverted_index":{"Greedy":[0,56],"algorithms":[1],"efficiently":[2],"approximate":[3],"combinatorial":[4,14],"optimization":[5],"problems,":[6],"but":[7],"their":[8],"guarantees":[9],"weaken":[10],"when":[11],"feasibility":[12],"couples":[13],"structure":[15],"with":[16],"global":[17],"physical":[18],"constraints.":[19,35],"We":[20,36,58],"study":[21],"monotone":[22],"nondecreasing":[23],"supermodular":[24],"minimization":[25],"over":[26],"the":[27,53,67,73,107,110,114],"bases":[28],"of":[29,69,75,109],"a":[30,41,49,60,80,87],"graphic":[31],"greedoid":[32],"under":[33],"physics-induced":[34],"model":[37],"physics-informed":[38],"selection":[39],"using":[40],"look-ahead":[42],"oracle":[43],"that":[44,92],"identifies":[45],"candidates":[46],"extendable":[47],"to":[48],"feasible":[50],"basis,":[51],"yielding":[52],"Conditioned":[54],"Sequential":[55],"Algorithm.":[57],"derive":[59],"closed-form":[61],"approximation":[62],"bound,":[63],"which":[64],"we":[65,90],"call":[66],"price":[68],"feasibility,":[70],"based":[71],"on":[72],"variability":[74],"oracle-restricted":[76],"candidate":[77],"sets":[78],"and":[79,112],"probabilistic":[81],"correction":[82],"for":[83,96],"unobserved":[84],"elements.":[85],"As":[86],"case":[88],"study,":[89],"show":[91],"FORWARD,":[93],"an":[94],"algorithm":[95],"multi-source":[97],"radial":[98],"network":[99],"reconfiguration,":[100],"instantiates":[101],"this":[102],"framework.":[103],"Numerical":[104],"results":[105],"demonstrate":[106],"tightness":[108],"bound":[111],"quantify":[113],"feasibility-optimality":[115],"trade-off.":[116]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-10T00:00:00"}