Problemcore
k-median problem
Also called k-median clustering.
Choose k centers minimizing the total (not squared) distance from points to their nearest center.
Choose k centers minimizing the total (not squared) distance from points to their nearest center.
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 D8T8TZ Edit this page History Report an error