5595 search results - page 41 / 1119 » Approximation Algorithms for Clustering Problems |
144
Voted
SODA
2001
ACM
15 years 4 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
125
click to vote
ICALP
1998
Springer
15 years 6 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
117
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
129
Voted
JGAA
2000
15 years 2 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
119
click to vote
BMCBI
2007
15 years 2 months ago
2007
Background: Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing cluster...