740 search results - page 35 / 148 » An approximation ratio for biclustering |
124
click to vote
CCCG
2010
15 years 3 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
113
click to vote
IPL
2008
15 years 1 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
ORL
2006
15 years 1 months ago
2006
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
125
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
111
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...