Travelling Salesman Problem is NP complete
A salesman has to Travel to all cities and come back to the starting point, with minimum cost The Order doesn’t matter. Visit a city only once
Does a graph G has tour of cost at most k?
A salesman has to Travel to all cities and come back to the starting point, with minimum cost The Order doesn’t matter. Visit a city only once
Does a graph G has tour of cost at most k?