3894 search results - page 324 / 779 » Approximation Algorithms for Biclustering Problems |
197
click to vote
ESA
1993
Springer
15 years 10 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
171
click to vote
SIGECOM
2003
ACM
15 years 12 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
187
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
271
Voted
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
163
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...