Sciweavers

Share
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
9 years 14 days ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
books