{
  "abstract": "Greedy algorithms efficiently approximate combinatorial optimization problems, but their guarantees weaken when feasibility couples combinatorial structure with global physical constraints. We study monotone nondecreasing supermodular minimization over the bases of a graphic greedoid under physics-induced constraints. We model physics-informed selection using a look-ahead oracle that identifies candidates extendable to a feasible basis, yielding the Conditioned Sequential Greedy Algorithm. We derive a closed-form approximation bound, which we call the price of feasibility, based on the variability of oracle-restricted candidate sets and a probabilistic correction for unobserved elements. As a case study, we show that FORWARD, an algorithm for multi-source radial network reconfiguration, instantiates this framework. Numerical results demonstrate the tightness of the bound and quantify the feasibility-optimality trade-off.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.07787",
  "author_total": 3,
  "authors": [
    {
      "name": "Joan Vendrell Gallart"
    },
    {
      "name": "Russell Bent"
    },
    {
      "name": "Solmaz Kia"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/b10e45y78xxs8.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.07787",
  "fulltext_url": null,
  "id": "b10e45y78xxs8",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.07787",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "arxiv",
      "math.OC"
    ],
    [
      "openalex",
      "1703|Complexity and Algorithms in Graphs"
    ]
  ],
  "openalex": "W7212007500",
  "pdf_url": "https://arxiv.org/pdf/2609.07787",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-07",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/b10e45y78xxs8.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:19:58Z",
      "native_id": "2609.07787",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.07787"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    },
    {
      "field": "mathematics",
      "origin": "arxiv:math.OC",
      "subfield": "optimisation-control"
    }
  ],
  "title": "The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids",
  "title_text": "The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids",
  "type": "preprint",
  "updated_at": "2026-10-30T12:19:58Z",
  "url": "https://research.draconitic.com/paper/b10e45y78xxs8",
  "venue": "arXiv",
  "versions": []
}