On finding a maximum spanning tree of bounded radius Original Research Article

We consider an NP-hard problem of finding in a complete non-oriented edge-weighted graph a spanning tree of maximal weight, and of radius not exceeding R>0. We give an algorithm for finding an approximate solution to the problem, with the time complexity O(n2) and relative error at most 1/R where n is the number of vertices of the input graph.