Parallelized approximation algorithms for minimum routing cost spanning trees

Abstract

We parallelize several previously proposed algorithms for the minimum routing cost spanning tree problem and some related problems.