Highly Influenced

5 Excerpts

@inproceedings{Doddi2000ApproximationAF, title={Approximation Algorithms for Clustering to Minimize the Sum of Diameters}, author={Srinivas Doddi and Madhav V. Marathe and S. S. Ravi and David Scot Taylor and Peter Widmayer}, booktitle={SWAT}, year={2000} }

- Published in SWAT 2000
DOI:10.1007/3-540-44985-X_22

We consider the problem of partitioning the nodes of a complete edge weighted graph into k clusters so as to minimize the sum of the diameters of the clusters. Since the problem is NP-complete, our focus is on the development of good approximation algorithms. When edge weights satisfy the triangle inequality, we present the rst approximation algorithm for the problem. The approximation algorithm yields a solution that has no more than 10k clusters such that the total diameter of these clusters… CONTINUE READING