
17. Approximate TSP. Imagine that you constructed an approximation algorithm for the Traveling Salesman Problem that could always calculate a solution that is correct within a factor of 1/k of the optimal tour in O(n -2k) time. Would you be able to use this approximation algorithm to obtain a “good” solution to all other NP-Complete problems? Explain why or why not. Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . .
PayPal Gateway not configured
PayPal Gateway not configured