Randomized Rounding for Set Cover

56 Views Asked by At

I am familiar with a randomized rounding-based algrothim for the minmum set cover problem that gives a solution that is $O(log(n))$ close to the optimum. For example, see here. Is it known whether there are other randomized rounding-based algrothims that give a constant approximation factor instead of the $log(n)$?