Before revision:  Together  these ideas lead to significantly faster approximation algorithms than known before  .
After revision:  Together these ideas lead to significantly faster approximation algorithms than known before for the two problems of interest. In addition, a fast algorithm for swap rounding in the graphic matroid is a generic tool that has other applications, including to TSP and submodular function maximization .