3894 search results - page 372 / 779 » Approximation Algorithms for Biclustering Problems |
151
click to vote
MP
2006
15 years 5 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
138
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
130
click to vote
ICTCS
2003
Springer
15 years 10 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
165
click to vote
BIRTHDAY
2009
Springer
15 years 9 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
191
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...