1. Improved approximation algorithms for the Steiner tree problem;Berman;J. Algorithms,1994
2. The Steiner problem with edge lengths 1 and 2;Bern;Inform. Process. Lett.,1989
3. Introduction to Algorithms;Cormen,1989
4. A threshold of lnn;Feige,1996
5. Garey, M. R. Johnson, D. S. 1978, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco