1. Agrawal A, Klein P, Ravi R (1995) When trees collide: an approximation algorithm for the generalized Steiner problem on networks. J SIAM Comput 24(3):440–456
2. Chlebik M, Chlebikova J (2002) Approximation hardness of the Steiner tree problem on graphs. In: 8th Scandinavian workshop on algorithm theory LNCS, vol 2368, pp 170–179
3. Goemans MX, Goldberg AV, Plotkin SA, Shmoys DB, Tardos É, Williamson DP (1994) Improved approximation algorithms for network design problems. In: Proceedings of the fifth annual ACM-SIAM symposium on discrete algorithms (SODA), pp 223–232
4. Goemans MX, Williamson DP (1995) A general approximation technique for constrained forest problems. SIAM J Comput 24(2):296–317
5. Grötschel M, Monma CL, Stoer M (1995) Design of survivable networks. In: Network models, handbooks in operations research and management science. North Holland Press, Amsterdam