Comment Re:Hamiltonian path != traveling salesman (Score 1) 135
I didn't RTFA, and the other comments in the discussion make me skeptical anyway, but your post seems to contradict itself. If the Traveling Salesman Problem is NP-complete (which I know to be true) and the Hamiltonian Path Problem is also NP-complete (which I assume is true from this discussion), then solving one problem is isomorphic to solving the other and a solution to either can be transformed into a solution to the other in polynomial time. If you'd be impressed "if they found the shortest path on an undirected graph with variable length edges", then you should be impressed with this, too (assuming they have found a solution as the summary indicates).
Ian