# 5 Prove that the Traveling Salesman Problem, (finding shortest tour

Content type
User Generated
Rating
Showing Page:
1/2
5. Prove that the Traveling Salesman Problem, (finding
shortest tour visiting n points in the plane) is in class NP
a) Optimization formulation
b) Decision formulation
c) Polynomial-size certificate
d) Polynomial time verification algorithm
Solution
Prove that TSP is NP-complete
Let first try to prove that TSP belongs to NP.
If we check the tour contains each vertex one for any trip
in the TSP problem.
Thus we sum up total cost of edges and we will finally find
the minimum cost.
This can be done in polynomial time and thus TSP is in NP
Next we will prove that iTSp is NP hard. We can do it
either by proving that hamilton cycle TSP.
Assume G =(V,E) to be in instance of hamiltionian cycle.
We will create a complete graph CG = (V,E)
Total cost will be given as
t(I,j) = 0 if (I,j) belongs to E
t(I,j) = 1 if(I,j) doesnt belong to E

Showing Page:
2/2

Unformatted Attachment Preview
5. Prove that the Traveling Salesman Problem, (finding shortest tour visiting n points in the plane) is in class NP a) Optimization formulation b) Decision formulation c) Polynomial-size certificate d) Polynomial time verification algorithm Solution Prove that TSP is NP-complete Let first try to prove that TSP belongs to NP. If we check the tour contains each vertex one for any trip in the TSP problem. Thus we sum up total cost of edges and we will finally find the minimum cost. This can be done in polynomial time and thus TSP is in NP Next we will prove that iTSp is NP hard. We can do it ei ...
Purchase document to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

### Review

Anonymous
Really great stuff, couldn't ask for more.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4