740 search results - page 22 / 148 » An approximation ratio for biclustering |
101
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
114
click to vote
ECCC
2000
15 years 1 months ago
2000
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...
108
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
127
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
109
click to vote
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...