Question 23
TSP ALGORITHMS
Answer the given subquestions.
A major drawback of Nearest Neighbour Heuristic for TSP is __________ .
it takes exponential computation time
it cannot handle sparse graphs
it often leaves a very long edge for the final return leg
it often returns premature subtours