Approximation of Set Cover
Dinur and Steurer [1] showed that assuming $P \neq NP$, there is no polynomial time algorithm which approximates set cover by a $(1-\epsilon)\ln(n)$ factor, for any constant $\epsilon &gt; 0$.
[1] https://arxiv.org/pdf/1305.1979.pdf