Our algorithms use a new method for transforming an optimal solution of the linear program relaxation of the s-median problem into a provably good integral solution. This departure from previous methods is crucial for the success of our algorithms. The problem is MAX SNP hard. Shmoys, Tardos et al. J.-H. Lin and J. S. Vitter.
Approximation algorithms for geometric median problems.
The graph only includes citing articles where the year of publication is known.