A new approach to solving the VLSI signal nets global routing problem has been suggested. An original algorithm for the synthesis of the set of the spanning trees, the cost of which is close to the minimum one, have been found; the results of this algorithm studies have been presented.