1. P. Berman and V. Ramaiyer, “Improved approximations for the Steiner tree problem”, in Proc. 3rd Annual Symposium on Discrete Algorithms, (1992) 325–334.
2. A. Blum, T. Jiang, M. Li, J. Tromp and M. Yannakakis, “Linear approximation of superstrings”, in Proc. 23rd Annual ACM Symposium on Theory of Computing, (1991) 328–336.
3. J. Edmonds, “Paths, trees and flowers,” Canadian J. Math. 17 (1957) 449–467.
4. M.R Garey and D.S. Johnson, “Computers and Intractability: A guide to the Theory of N P-Completeness”, W.H. Freeman & Co., San Francisco, 1979.
5. C. Greene and T.L. Magnanti, “Some abstract pivot algorithms”, Working Paper OR 037-74,(1974), Operations Research Center, MIT,USA.