Guarantee
Returns a permitted r-commodity set and common rate at least (1-\varepsilon)\mathrm{OPT}, with one shared setup and routing budget and all routing-only budgets exact.
Objective and output
Maximize selected concurrent rate; output the actual selected set and its splittable flow.
Randomness
Deterministic, conditional on the paid exact minimum-setup restriction optimizer and exact rational flow-LP primitives.
Time
The corank-parameter and fixed-accuracy whole-ground bounds are:
For the whole-ground bound, \varepsilon is fixed and rational.
Space
Polynomial in the explicit network, selected-set state, rational flow witnesses, and paid oracle workspace.
Parameters
c=q-r; 0<\varepsilon<1 is rational; setup fees and routing charges are nonnegative; \Gamma(R)=R^R/(R-1)^{R-1}; H includes the exact minimum-setup restriction optimizer.
Model and representation
A fixed family of permitted r-sets with an attained exact minimum setup cost on every restriction, a rational directed network, splittable flows, and one combined exact budget.
Lower-bound scope
No lower bound is claimed; an ordinary existence-only restriction selector does not provide the required minimum-setup optimizer.
Review status
Ready for review. The complete selected-flow theorem with one shared commodity-setup and routing budget, including attained minimum-setup restriction optimization, the protected-witness invariant under adaptive residual budgets, exact Farkas separation, rational reoptimization and fixed-accuracy whole-ground conversion. The reference recomputes the actual set residual and supplies exact primal/dual certificates.
Dependencies and scope. Exact polynomial rational LP, Farkas duality and the specified paid selection oracle remain mathematical dependencies. The whole-ground sharp base is stated for fixed rational accuracy. Splittable rational flow is required; integral or unsplittable multicommodity routing is outside the model. The shipped reference uses finite Bland simplex and explicit selected-set enumeration with separate potentially exponential running times. It supplies exact fixed-set certificates and normalized separation, but not the omission recursion or rational target search. The minimum-setup restriction oracle must attain its minimum on the actual returned set. An existence-only selector or separately minimized unrelated setup objectives is insufficient. Fixed routing-only budgets remain allowed.
The verification note identifies executable coverage. This status does not claim external peer review or proof-assistant verification.
Source
Manuscript and proof, with dependencies and verification sources.
The exact returned set must attain the setup cost used to compute the residual routing budget. The proof maintains one protected full-rate witness through the changing budget.
Attribution. icekylinx · GPT-6 Astra Pro