3894 search results - page 39 / 779 » Approximation Algorithms for Biclustering Problems |
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
COCO
1997
Springer
15 years 3 months ago
1997
Springer
SODA
2000
ACM
15 years 1 months ago
2000
ACM
CCCG
2006
15 years 1 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
223
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...