Minimum True Monotone 3SAT
This problem is the same as the Vertex Cover problem for $3$-uniform hypergraphs: 
given a collection $H$ of subsets of $V$ of size $3$ each, find a minimal subset $U\subseteq V$ that intersects each set in $H$.

It is therefore NP-hard, but fixed parameter tractable. 
It is also NP-hard to approximate to within a factor of $2-\epsilon$ for every $\epsilon&gt;0$. This was shown in the following paper:

Irit Dinur, Venkatesan Guruswami, Subhash Khot and Oded Regev.
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover,
SIAM Journal on Computing, 34(5):1129–1146, 2005.