Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
What is the approximation ratio of the standard greedy algorithm for the Vertex Cover problem?
1
1.5
2
log n
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!