3 ms·Interesting fact: the standard DP algorithm for TSP reduces the running time from O(n!) to O(n^2 2^n)by zodiac 8y agoInteresting fact: the standard DP algorithm for TSP reduces the running time from O(n!) to O(n^2 2^n)