In grad school, wrote a paper as a homework assignment for a course where reviewed a paper on the idea of using a minimium spanning tree for the traveling sales

In grad school, wrote a paper as a homework assignment for a course where reviewed a paper on the idea of using a minimium spanning tree for the traveling salesman problem. The paper did have some math addressing how close the idea was to optimality. That was a long time ago, and now don't have the reference or the homework! From a fast search, now there is https://www.geeksforgeeks.org/approximate-solution-for-travelling-salesman-problem-using-mst/ https://www.geeksforgeeks.org/approximate-solution-for-trave... https://en.wikipedia.org/wiki/Minimum_spanning_tree https://en.wikipedia.org/wiki/Minimum_spanning_tree Am reminded that the nodes to be visited must have distances that obey the triangle inequality, e.g., like a plane. Then when traversing the tree, when there is no arc in the tree to the next node, just leave the tree and go direct.