Answer to Question #144703 in Algorithms for NG CHUN KAI

Question

Q2: As we know, the heuristic or approximation algorithms may not give an optimum solution to the problem but they are polynomial efficient.

(a) Propose an approximation algorithm for travelling salesman problem (TSP) and discuss about its time complexity and limitation. (6 marks)

(b) Give two example inputs, in which the algorithm in (a) gives the best and not-thebest solutions, respectively. The number of nodes should be between six and eight. (4 marks)

Answer 1

Dear NG CHUN KAI, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order