Sciweavers

5595 search results - page 1 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SODA
2000
ACM
125views Algorithms» more  SODA 2000»
15 years 5 days ago
Approximation algorithms for projective clustering
We consider the following two instances of the projective clustering problem: Given a set
Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 3 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
70
Voted
COLT
1999
Springer
15 years 3 months ago
Approximation Algorithms for Clustering Problems
David B. Shmoys