To solve the vertex cover problem, there is a greedy algorithm t

To solve the vertex cover problem, there is a greedy algorithm that collects the vertex with the highest degree (i.e., the one covering the largest number of edges) and remove it from the graph at each stage. This greedy algorithm achieves an approximation ratio of 2. ~@[](2)

答案：FALSE