Question: Show how in polynomial time we can transform one instance of the traveling-salesman problem into another instance whose cost function satisfies the triangle inequality. The
Show how in polynomial time we can transform one instance of the traveling-salesman problem into another instance whose cost function satisfies the triangle inequality. The two instances must have the same set of optimal tours. Explain why such a polynomial-time transformation does not contradict Theorem 35.3, assuming that P ≠ NP.
Step by Step Solution
3.22 Rating (163 Votes )
There are 3 Steps involved in it
To transform one instance of the traveling salesman problem TSP into another instance whose cost fun... View full answer
Get step-by-step solutions from verified subject matter experts
