7015 search results - page 20 / 1403 » Approximation algorithms for co-clustering |
154
click to vote
SIAMCOMP
1998
15 years 4 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...
136
click to vote
AAIM
2007
Springer
15 years 10 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...