Stability of reapproximation algorithms for the β-metric traveling Salesman (path) problem