1. Computers and intractability: a guide to the theory of NP-completeness;Garey,1979
2. The Steiner problem in graphs;Drefus;Networks,1971
3. Algorithm for the shortest connection of a group of graph vertices;Levin;Soviet Mathematics Dokl,1971
4. An algorithm for the Steiner problem in graphs;Shore;Networks,1982
5. Yang YY, Wing O. An algorithm for the wiring problem. Digest of the IEEE International Symposium on Electrical Networks, 1971. p. 14–5.