7015 search results - page 20 / 1403 » Approximation algorithms for co-clustering |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
SODA
2010
ACM
14 years 5 months ago
2010
ACM
SODA
2010
ACM
14 years 5 months ago
2010
ACM
SIAMCOMP
1998
13 years 7 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
AAIM
2007
Springer
14 years 1 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...