Problemadvanced
Post office problem
Also called k-median on a line, placing k post offices on a line.
Choose k facility positions on a line to minimize total distance from houses to their nearest facility.
Choose k facility positions on a line to minimize total distance from houses to their nearest facility.
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 19BYG6 Edit this page History Report an error