740 search results - page 61 / 148 » An approximation ratio for biclustering |
102
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
131
click to vote
IFIPTCS
2010
14 years 9 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
130
click to vote
MST
2010
14 years 6 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
111
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...