3894 search results - page 123 / 779 » Approximation Algorithms for Biclustering Problems |
204
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
159
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
166
click to vote
INFOCOM
2008
IEEE
16 years 24 days ago
2008
IEEE
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
159
click to vote
DAM
2008
15 years 6 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
138
click to vote
APPROX
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...