Some cosmetic edits and one big change

It turns out that our upper-bound includes a factor of sqrt(k)
that we weren't including. The TSP of n points in a k-dimensional
box of side-length n has length at most O(sqrt(k)n^{1-1/k}).