Problem
1. Is there an immediate polynomial-time reduction from the traveling-salesman problem on graphs to the Euclidean traveling-salesman problem, or vice versa?
2. What would be the significance of a program that could solve the traveling salesman problem in time proportional to 1.1N?