740 search results - page 68 / 148 » An approximation ratio for biclustering |
110
click to vote
BIRTHDAY
2009
Springer
15 years 3 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...
128
click to vote
FOCS
2007
IEEE
15 years 3 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...
139
click to vote
DCOSS
2008
Springer
15 years 1 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
110
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
113
click to vote
ALGORITHMICA
2006
14 years 12 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...