1. A. Agrawal, P. Klein, andR. Ravi: ?When trees collide: An approximation algorithm for the generalized Steiner problem in networks?,Proc. 23rd ACM Symp. on Theory of Computing, 134?144 (1991).
2. P. Berman andV. Ramaiyer: ?Improved approximations for the Steiner tree problem?,Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 325?334 (1992).
3. G. Dobson: ?Worst-case analysis of greedy heuristics for integer programming with non-negative data?,Math. of Oper. Res. 7, 515?531 (1982).
4. G. N. Frederickson andJ. Ja'Ja': ?Approximation algorithms for several graph augmentation problems?,SIAM J. Comput. 10, 270?283 (1981).
5. H. N. Gabow, M. X. Goemans, andD. P. Williamson: ?An Efficient Approximation algorithm for the survivable network design problem?,Proc. Third Conference on Integer Programming and Combinatorial Optimization, 57?74 (1993).