Geometric clustering to minimize the sum of cluster sizes

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 460-471

  Bilò, Vittorio ^a   Caragiannis, Ioannis ^b   Kaklamanis, Christos ^b   Kanellopoulos, Panagiotis ^b  

^a UNIVERSITY OF SALENTO   (Italy)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; CLUSTERING PROBLEMS; GEOMETRIC CLUSTERING; POLYNOMIAL TIME APPROXIMATION;

GEOMETRY;

EID: 27144540449     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_42     Document Type: Conference Paper

References (16)

1. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for the Euclidean k-medians and related problems. In Proc. of the 30th ACM Symposium on Theory of Computing (STOC'98), pp. 106-113, 1998.
2. M. Bǎdoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC'02), pp. 250-257, 2002.
3. Y. Bartal, M. Charikar, and D. Raz. Approximating min-sum k-clustering in metric spaces. In Proc. of the 33rd Annual ACM Symposium on Theory of computing (STOC'01), p.11-20, 2001.
4. P. Brucker. On the complexity of clustering problems. Optimization and Operations Research, Lecture Notes in Economics and Mathematical Sciences, Vol. 157, pp. 45-54, 1978.
5. M. Charikar, S. Guha, E. Tardos, and D. S. Shmoys. A constant factor approximation algorithm for the k-median problem. Journal of Computer and Systems Sciences, Vol. 65 (1), pp. 129-149, 2002.
6. M. Charikar and R. Panigrahy. Clustering to minimize the sum of cluster diameters. Journal of Computer and Systems Sciences, Vol. 68 (2), pp. 417-441, 2004.
7. V. Capoyleas, G. Rote, and G. J. Woeginger. Geometric Clusterings. Journal of Algorithms, Vol. 12(2), pp. 341-356, 1991.
8. S. R. Doddi, M. V. Marathe, S. S. Ravi, D. S. Taylor, and P. Widmayer. Approximation algorithms for clustering to minimize the sum of diameters. Nordic Journal of Computing, Vol. 7(3), pp. 185-203, 2000.
9. T. Erlebach, K. Jansen, and E. Seidel. Polynomial-time approximation schemes for geometric graphs. In Proc of the 12th Annual Symposium on Discrete Algorithms (SODA'01), pp. 671-679, 2001.
10. W. Fernandez de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani. Approximation schemes for clustering problems. In Proc. of the 35th Annual ACM Symposium on Theory of Computing (STOC'03), pp. 50-58, 2003.
11. A. Freund and D. Rawitz. Combinatorial interpretations of dual fitting and primal fitting. In Proc. of the First International Workshop on Approximation and Online Algorithms (WAOA'03), LNCS 2909, Springer, pp. 137-150, 2003.
12. P. Hansen and B. Jaumard. Minimum sum of diameters clustering. Journal of Classification, Vol. 4, pp. 215-226, 1987.
13. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual scheme and Lagrangian relaxation. Journal of the ACM, Vol. 48, pp. 274-296, 2001.
14. N. Lev-Tov and D. Peleg. Polynomial time approximation schemes for base station coverage with minimum total radii. Computer Networks, Vol. 47, pp. 489-501, 2005.
15. C. L. Monma and S. Suri. Partitioning points and graphs to minimize the maximum or the sum of diameters. Graph Theory, Combinatorics and Applications, John Wiley and Sons, pp. 880-912, 1991.
16. R. Ostrovsky and Y. Rabani. Polynomial-time approximation schemes for geometric clustering problems. Journal of the ACM, Vol. 49(2), pp. 139-156, 2002.