Algorithm: k-Center Clustering

Input: A set X of points, integer k (number of centers)

Output: Set C of k centers

​

1. Initialize C with an arbitrary point from X

2. For i = 2 to k do

     a. Select a point p from X not in C that maximizes the minimum distance to any point in C

     b. Add p to C

3. Return C