Traveling salesman solution within 2N for optimal solution length N is trivially solvable for K^2log(K) for K places. Just make the minimal spanning tree and do a loop of it.

A lot of professors don't teach this, and it's recklessly ignorant if not worse.