Answers are grounded in this paper and cite their sources.
We determine the initial small-support Price-of-Hierarchy landscape for weighted one-dimensional Euclidean k-means. We prove the exact four-support value rho_4^(1D)=2.348593976994... and the exact five-support value rho_5^(1D)=2.532294839182566...>5/2. The five-support result yields, to our knowledge, the first non-trivial lower bound for the unrestricted k-means Price of Hierarchy. The proof classifies the 96 formal optimum-cut patterns on five ordered supports into 24 nested, 12 single-conflict, and two reflected double-conflict survivors; proves every single-conflict case is at most 5/2; and closes the critical double-conflict case through anchor elimination, threshold normalization, and an exact 35,629-coefficient positivity certificate. We also prove a sharp four-support Ward-extension inequality and derive a sharp local 2+sqrt(2) Ward bound.
No takes yet. Share an insight, caveat, or question.
Haitam Kadri (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: