e are given a graph G = (V, U), where V is the set of nodes and U is the set of weighted edges. Let d ij be the length (or weight) of edge (i, j) ∈ U.  An adaptive greedy approach for this problem is to grow the set of 