Let k be a positive integer. Consider MIN-SC(k) as the following restricted version of MIN-SC. The instances of MIN-SC(k) are usual instances (X, F) of MIN-SC with the additional restriction that each element x ∈ X is contained in at most k sets from F. Apply the method of the relaxation to LP in order to design a k-approximation algorithm for MIN-SC(k).