Clustering to minimize the sum of cluster diameters

Journal of Computer and System Sciences

Volumn 68, Issue 2, 2004, Pages 417-441

  Charikar, Moses ^a   Panigrahy, Rina ^b  

^a Princeton University   (United States)

^b CISCO SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; SYSTEMS SCIENCE;

APPROXIMATION ALGORITHMS; CLUSTER DIAMETERS; CLUSTERING; LOGARITHMIC APPROXIMATION;

COMPUTER SCIENCE;

EID: 1842458342     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.07.014     Document Type: Article

References (21)

1. Y. Bartal, M. Charikar, D. Raz, Approximating min-sum k-clustering in metric spaces, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 11-20, Crete, Greece.
2. M. Charikar, C. Chekuri, T. Feder, R. Motwani, Incremental clustering and dynamic information retrieval, Proceedings of the 29th Annual ACM Symposium on Theory of Computing 1997, pp. 626-635, El-Paso, Texas.
3. M. Charikar, S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 378-388, New York, New York.
4. M. Charikar, S. Guha, E. Tardos, D. Shmoys, A constant factor approximation algorithm for the k-median problem, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 1-10, Atlanta, Georgia.
5. F. Chudak, Improved approximation algorithms for uncapacitated facility location, Proceedings of the Sixth Conference on Integer Programming and Optimization, Lecture in Computer Science, Vol. 1412, Springer, Berlin, 1998, pp. 180-194.
6. F.A. Chudak, T. Roughgarden, D.P. Williamson, Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation, Proceedings of the Eighth Conference on Integer Programming and Optimization, Lecture Notes in Computer Science, Vol. 2081, Springer, Berlin, 2001, pp. 60-70.
7. F.A. Chudak, D. Shmoys, Improved approximation algorithms for the capacitated facility location problem, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. S875-S876, Baltimore, Maryland.
8. G. Cornuéjols, G.L. Nemhauser, L.A. Wolsey, The uncapacitated facility location problem, in: P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, Wiley, New York, 1990.
9. S.R. Doddi, M.V. Marathe, S.S. Ravi, D.S. Taylor, P. Widmayer, Approximation algorithms for clustering to minimize the sum of diameters, Nordic J. Comput. 7 (3) (2000) 185-203.
10. M. Dyer, A.M. Frieze, A simple heuristic for the p-center problem, Oper. Res. Lett. 3 (1985) 285-288.
11. S. Guha, S. Khuller, Greedy strikes back: improved facility location algorithms, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 649-657.
12. S. Guha, N. Mishra, R. Motwani, L. O'Callaghan, Clustering data streams, Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 2000, pp. 359-366, Redondo Beach, California.
13. N. Guttman-Beck, R. Hassin, Approximation algorithms for min-sum p-clustering, Discrete Appl. Math. 89 (1998) 125-142.
14. P. Hansen, B. Jaumard, Cluster analysis and mathematical programming, Math. Programming 79 (1997) 191-215.
15. D.S. Hochbaum, D.B. Shmoys, A best possible approximation algorithm for the k-center problem, Math. Oper. Res. 10 (1985) 180-184.
16. K. Jain, V. Vazirani, Approximation algorithms for metric facility location and k-median problems using the primal-dual scheme and Lagrangian relaxation, Journal of the ACM 48 (2001) 274-296.
17. O. Kariv, S.L. Hakimi, An algorithmic approach to network location problems, Part ii: p-medians, SIAM J. Appl. Math. 37 (1979) 539-560.
18. M. Korupolu, C. G. Plaxton, R. Rajaraman, Analysis of a local search heuristic for facility location problems, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 1-10, San Francisco, California.
19. J.-H. Lin, J.S. Vitter, Approximation algorithms for geometric median problems, Inform. Process. Lett. 44 (1992) 245-249.
20. C.L. Monma, S. Suri, Partitioning points and graphs to minimize the maximum or the sum of diameters, in: Alavi et al. (Eds.), Graph Theory, Combinatorics and Applications, Wiley, 1991, pp. 880-912.
21. D.B. Shmoys, E. Tardos, K.I. Aardal, Aproximation algorithms for facility location problems, Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 265-274, El Paso, Texas.