3894 search results - page 46 / 779 » Approximation Algorithms for Biclustering Problems |
130
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
108
click to vote
COCOON
2007
Springer
15 years 9 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 (...
112
click to vote
APPROX
2004
Springer
15 years 8 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...
132
click to vote
SODA
2008
ACM
15 years 4 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...
145
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...