Improving the performance of Approximation algorithm to solve Travelling Salesman Problem using Parallel Algorithm

Travelling salesman problem predicts the shortest possible route to connect different cities based on given distances between each city. Here each city should be traversed only once and finally the person tracing the route should reach to the starting point of the journey with the minimal cost of the whole journey. Solving a TSP requires application of many graph algorithms which are helpful in analysing the TSP and hence the in finding the optimal solution of TSP.