1161 search results - page 3 / 233 » Approximation schemes for clustering problems |
NIPS
2003
13 years 7 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
ICALP
2011
Springer
12 years 9 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
CATS
2006
13 years 7 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
UIC
2007
Springer
13 years 12 months ago
2007
Springer
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
