A greedy approximation algorithm for the group Steiner problem Original Research Article

In the group Steiner problem we are given an edge-weighted graph image and m subsets of vertices image. Each subset image is called a group and the vertices in image are called terminals. It is required to find a minimum weight tree that contains at least one terminal from every group.