Uniform unweighted set cover: The power of non-oblivious local search

We are given n base elements and a finite collection of subsets of them. The size of any subset varies between p to k (p