5595 search results - page 194 / 1119 » Approximation Algorithms for Clustering Problems |
166
click to vote
ICPR
2008
IEEE
16 years 17 days ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
165
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
156
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
144
click to vote
COR
2006
15 years 6 months ago
2006
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
140
click to vote
IPL
2008
15 years 6 months ago
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...