**K-median Algorithms: Theory in Practice**

k-median problem as simply the k-median problem. If X = F = C, a k-median algorithm simply clusters the points in the metric space. 1.3 Existing Theoretical Research There is a large body of existing research on k-median approximation algorithms. A forward greedy algorithm iteratively open facilities by choosing the next unopened facility so as to minimize the cost function de ned above ...

Continue Reading...