As we know there is a 2-approximation algorithm for the Vertex C

As we know there is a 2-approximation algorithm for the Vertex Cover problem. Then we must be able to obtain a 2-approximation algorithm for the Clique problem, since the Clique problem can be polynomially reduced to the Vertex Cover problem. ~@[](2)

答案：FALSE