which of the following statement is true about traveling salesman problem
Answers
Answered by
5
Answer:
Since it takes exponential time to solve NP, the solution cannot be checked in the real polynomial time. ... Option 2: As said earlier The Travelling Salesman Problem is one of the known NP-hard problems, which means that there is no specific particular algorithm to solve it in given time complexity.
I hope that this answer helpful to you..,........
Answered by
0
Answer:
no statement is mentioned....
Similar questions