You should probably convert the MST into a tour, and that'll give you a bound less than 2 * MST length, in linear time. There is also an extension to MST, called Christofide's Algorithm that might be worth looking into as well.
Recommend taking a look at the Wikipedia page for TSP heuristics.