Theoremadvanced
k-center inapproximability
Also called Hsu-Nemhauser k-center hardness.
K-center cannot be approximated within 2-ε unless P = NP, matching the farthest-first algorithm.
K-center cannot be approximated within 2-ε unless P = NP, matching the farthest-first algorithm.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 5WNEVK Edit this page History Report an error