6.19. Reduction of Hamiltonian Cycle to Traveling Salesman¶
6.19.1. Hamiltonian Cycle to Traveling Salesman¶
The following slideshow shows that an instance of HAMILTONIAN CYCLE can be reduced to an equivalent instance of TSP in polynomial time.
This reduction can help in providing an NP Completeness proof for the Traveling Salesman problem.
