I need to prove that for some $\epsilon$ the approximate solution of Set Cover Problem with precision $\epsilon$ is an NP-hard problem.
Can I present this problem as a VERTEX-COVER problem and then reduce MIN-3SAT to VERTEX-COVER and show that for some $\epsilon$ the approximate solution of VERTEX-COVER with precision $\epsilon$ is an NP-hard problem?