Video solution will be uploaded soon.
Consider the following statements of approximation algorithm:Statement I: Vertex-cover is a polynomial time 2-approximation algorithm.Statement II: TSP-tour is a polynomial time 3-approximation algorithm for travelling salesman problem with the triangle inequality.Which of the following is correct? | Watch the step-by-step video solution for this NIMCET PYQ.