1. When trees collide: an approximation algorithm for the generalized Steiner problem on networks;Agrawal;SIAM J. Comput.,1995
2. M. Andrews, L. Zhang, The access network design problem, in: IEEE Symposium on Foundations of Computer Science (FOCS), 1998, pp. 40–49.
3. Proof verification and the hardness of approximation problems;Arora;J. ACM,1998
4. L. Becchetti, J. Könemann, S. Leonardi, M. Pál, Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy, in: ACM–SIAM Symposium on Discrete Algorithms (SODA), 2005, pp. 375–384.
5. The Steiner problem with edge lengths 1 and 2;Bern;Inform. Process. Lett.,1989