If we really need the absolute best tour, approximation algorithms are not the way to go.
Instead, we will need to, in essence, check all tours.
We can do this in enumerating all permutations of the nodes. Running time?
More clever schemes can actually get this down to O(2n).
