Minimal Distance Hamiltonian Path Javascript

Question

I know this is a fairly frequent question (tsp in general), but I\'ve been stumped by it for awhile now. I\'m looking to find the minimal distance hamiltonian path given a s

Answer 1

You can solve the bitonic euclidean traveling-salesman problem. Is a simplified version of the tsp solvable through dynamic programming in O(n^2): http://en.wikipedia.org/wiki/Bitonic_tour