## Clustering for Edge-Cost Minimization (0)

by
Leonard J. Schulman

Citations: | 32 - 5 self |

### BibTeX

@MISC{Schulman_clusteringfor,

author = {Leonard J. Schulman},

title = {Clustering for Edge-Cost Minimization},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

Leonard J. Schulman College of Computing Georgia Institute of Technology Atlanta GA 30332-0280 ABSTRACT We address the problem of partitioning a set of n points into clusters, so as to minimize the sum, over all intracluster pairs of points, of the cost associated with each pair. We obtain a randomized approximation algorithm for this problem, for the cost functions ` 2 2 ; `1 and `2 , as well as any cost function isometrically embeddable in ` 2 2 .