1. Garey, M. R., Graham, R. L., Johnson, D. S. (1977), “The Complexity of Computing Steiner Minimal Trees,” SIAM J. Appl. Math. 32, 835–859.
2. Hildebrandt, S. (1989), “The Calculus of Variations Today,” The Math. Intelligence, 11 (4)50–60.
3. Ivanov, A. O. and Tuzhilin, A. A. (1994), “Minimal Networks-The Steiner Problem and its Generalizations,” CRC Press, Boca Raton.
4. MacGregor Smith, J. and Toppur, B. (1996) “Euclidean Steiner Minimal Trees, Minimum Energy Configurations and the Embedding Problem of Weighted Graphs in E
3,” Discrete Appl. Math., 71, 187–215.
5. Mondaini, R. (2001), “The Minimal Surface Structure of Biomolecules,” Proceedings of the I Brazilian Symposium on Mathematical and Computational Biology, ed. E-papers Ltda.,1–11 and references therein.