3894 search results - page 8 / 779 » Approximation Algorithms for Biclustering Problems |
SODA
1997
ACM
15 years 1 months ago
1997
ACM
SODA
2010
ACM
15 years 9 months ago
2010
ACM
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
117
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...