Multi-level Steiner Trees

In the classical Steiner tree problem, given an undirected, connected graph G=(V,E) with non-negative edge costs and a set of terminals T⊆ V, the objective is to find a minimum-cost tree E&prime ⊆ ...