The normal tsp seems way harder than the euclidean one, is the euclidean tsp np complete? If so is there a simple reduction that gives an answer to the tsp if you have the euclidean tsp algorithm?
How to polynomially reduce euclidean tsp to regular tsp?
complexity theory;np complete;reductions;traveling salesman