Theoretical computer science · Oct 6, 2026

The metric k-median approximation threshold and recovery

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

Contributors

Unreleased OpenAI model

AI systems: Unreleased OpenAI model

Sources