Cost of sequential connection for points in space
A sequential minimal insertion procedure is used to produce a spanning tree, and the cost is estimated. The technique developed can also be used to the nearest neighbor heuristic for the traveling salseman problem and some other problems.
scientific article; zbMATH DE number 4106631