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?
1
Statement I true and Statement II false
2
Statement I and Statement II true
3
Statement I false and Statement II true
4
Statement I and Statement II false