3894 search results - page 381 / 779 » Approximation Algorithms for Biclustering Problems |
137
click to vote
INFORMATICALT
2010
15 years 3 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
130
click to vote
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
141
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...
105
click to vote
SOFSEM
2004
Springer
15 years 10 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
157
click to vote
NETWORKS
2011
15 years 1 hour ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...