740 search results - page 14 / 148 » An approximation ratio for biclustering |
114
click to vote
TAMC
2007
Springer
15 years 8 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
129
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
197
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
104
click to vote
JCSS
2010
15 years 9 days ago
2010
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...
113
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...