5595 search results - page 76 / 1119 » Approximation Algorithms for Clustering Problems |
143
click to vote
DAWAK
2007
Springer
15 years 11 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
165
click to vote
PAKDD
2010
ACM
15 years 6 months ago
2010
ACM
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
123
click to vote
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
126
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
146
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...