Approximation algorithms for the covering Steiner problem

Goran Konjevod, R. Ravi, Aravind Srinivasan

Abstract: The covering Steiner problem is a generalization of both the k-MST and the group Steiner problems: given an edge-weighted graph, with subsets of vertices called the groups, and a nonnegative integer ...