Minimum-weight tree labelings for every attainable unary total
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.explicit_tree_menu_optimizeralgorithmsclusteringdynamic-programming
The input explicitly lists a finite tree, finite menus with unary resource contributions and signed rational weights, and allowed pairs on edges. Output legal state-index vectors attaining the least total weight at each attainable resource total.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_FiniteMenuTrees import Definitions.Def_QuantumMaxCutFiniteNumericRuntime open StableMSR.Recovery.Supplement.BinaryRecovery.Regional open StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree open OAI.MetricKMedian.Binary.Automatic
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.explicit_tree_menu_optimizer : ∃ A : Instance→List Block, Poly A ∧ ∀ I, (layoutTree I.1).IsTree → Optima I (A I) := by sorry
Source
Ravichandran and Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Appendix A.6, tree-decomposition dynamic program. Explicit binary witness formulation.