3894 search results - page 131 / 779 » Approximation Algorithms for Biclustering Problems |
158
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
187
click to vote
AAIM
2006
Springer
16 years 12 days ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
155
click to vote
TALG
2010
15 years 4 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
157
click to vote
COMPGEOM
2009
ACM
16 years 28 days ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
206
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...