On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem | AMiner