7129 search results - page 37 / 1426 » Approximation Algorithms for Treewidth |
114
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
85
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
136
Voted
SIAMCOMP
1998
15 years 2 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...
111
Voted
AAIM
2007
Springer
15 years 8 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...
110
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...