...
Data-Structures
October 12, 2023
Programming
October 12, 2023
Data-Structures
October 12, 2023
Programming
October 12, 2023

Algorithm-Paradigms

Question 8
Twice-around the spanning tree algorithm for solving the Travelling Salesman Problem with Euclidean distances is a ______
A
2-approximation algorithm
B
1.5 approximation algorithm
C
1.25 approximation algorithm
D
2.5 approximation algorithm
AlgorithmsAlgorithm-ParadigmsAPPSC-2016-DL-CS
Correct Answer: A
PRIYANKA HEMBRAM

Leave a Reply

Your email address will not be published. Required fields are marked *