Optimal algorithms for approximate clustering
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC ’88
Daniel Greene
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks