A Polynomial-time Approximation Scheme for the Minimum Routing Cost Tree Problem