Construction of a sequence of minimal covering trees

Algorithms are developed for construction of a sequence of minimal covering trees, which may be needed in tackling the traveling salesman problem. An estimate of fast algorithms is given.