3894 search results - page 40 / 779 » Approximation Algorithms for Biclustering Problems |
APPROX
2000
Springer
15 years 7 months ago
2000
Springer
114
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
141
Voted
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
108
click to vote
IPL
2007
15 years 2 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...