JCSS   2002
Wall of Fame | Most Viewed JCSS-2002 Paper
199views more  JCSS 2002»
13 years 2 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source199
2Download preprint from source114
3Download preprint from source95
4Download preprint from source95
5Download preprint from source94
6Download preprint from source86
7Download preprint from source84
8Download preprint from source78
9Download preprint from source59
10Download preprint from source58
11Download preprint from source55
12Download preprint from source51
13Download preprint from source43