Data-Structures
October 12, 2023Programming
October 12, 2023Algorithm-Paradigms
|
Question 8
|
Twice-around the spanning tree algorithm for solving the Travelling Salesman Problem with Euclidean distances is a ______
|
2-approximation algorithm
|
|
|
1.5 approximation algorithm
|
|
|
1.25 approximation algorithm
|
|
|
2.5 approximation algorithm
|
Correct Answer: A
Subscribe
Login
0 Comments