We present efficient MapReduce and Streaming algorithms for the kkk-center problem with and without outliers. Our algorithms exhibit an approximation factor which is arbitrarily close to the best possible, given enough resources.
