On the Approximability of the Minimum Test Collection Problem.
Approximation algorithms for a capacitated network design problem.
An approximation algorithm for the covering Steiner problem. A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. Improving Minimum Cost Spanning Trees by Upgrading Nodes. A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SIAM J. Comput.