Remark: Family 125. The approximation threshold for metric k -median

Gives a deterministic polynomial-time $(1+2/e+\epsilon )$-approximation for finite rational metric $k$-median with specified candidate facilities, for every fixed $\epsilon >0$. Assuming $P\ne NP$, the optimal infimum approximation factor is $1+2/e$.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.