We have seen that the Dynamic Programming algorithm for the Traveling Salesman Problem has a time complexity of T(n) = (n - 1)(n
– 2)2n-3 . Suppose that on our present computer we can run an instance of n = 5 in 4 sec. How long does it take for the computer to perform one basic operation?
1 answer:
You might be interested in