Place K pickup points to minimize total L1 distance

Given the coordinates of N people, choose K shuttle pickup locations so that the sum of each person's Manhattan (L1) distance to their nearest pickup is as small as possible.

Discuss exact approaches for small inputs and a k-medians style iteration (the median per coordinate minimizes L1 within a cluster).