Question: Consider the general optimization version of the TSP problem, where the underlying graph need not satisfy the triangle inequality. Show that, for any fixed value
Consider the general optimization version of the TSP problem, where the underlying graph need not satisfy the triangle inequality. Show that, for any fixed value δ ≥ 1, there is no polynomial-time δ-approximation algorithm for the general TSP problem unless P = NP.
Step by Step Solution
3.41 Rating (154 Votes )
There are 3 Steps involved in it
Use the hint That is suppose we are given an insta... View full answer
Get step-by-step solutions from verified subject matter experts
