Probability
October 14, 2023Digital-Logic-Design
October 14, 2023NTA-UGC-NET 2021 Dec & 2022 June Paper-2
| Question 44 |
Consider the following statements of approximation algorithm:
Statement I: Vertex-cover is a Polynomial time 2-approximation algorithm.
Statement II: TSP-your polynomial time 3-approximation algorithm for traveling salesman problem with the triangle inequality.
Which of the following is correct?
Statement I: Vertex-cover is a Polynomial time 2-approximation algorithm.
Statement II: TSP-your polynomial time 3-approximation algorithm for traveling salesman problem with the triangle inequality.
Which of the following is correct?
| Statement I true and Statement II false | |
| Statement I and Statement II true | |
| Statement I false and Statement II true | |
| Statement I and Statement II false |
Correct Answer: B
Subscribe
Login
0 Comments