JCSS 2002
 |  |
Wall of Fame | Most Viewed JCSS-2002 Paper
JCSS
2002
13 years 4 months ago
2002
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...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 199 | ||
| 2 | | 114 | ||
| 3 | | 95 | ||
| 4 | | 95 | ||
| 5 | | 94 | ||
| 6 | | 86 | ||
| 7 | | 84 | ||
| 8 | | 78 | ||
| 9 | | 59 | ||
| 10 | | 58 | ||
| 11 | | 55 | ||
| 12 | | 51 | ||
| 13 | | 43 |