1. N. R. Achuthan, L. Caccetta, P. Caccetta, and J. F. Geelen. Algorithms for the minimum weight spanning tree with bounded diameter problem. In et al. P. H. Phua, editor, Optimization Techniques and Applications, volume 1, pages 297–304. World Scientific, 1992.
2. R. Ahuja, T. Magnanti, and J. Orlin. Network flows: Theory, algorithms and applications. Prentice Hall, 1993.
3. D. Alevras, M. Grötschel, and R. Wessaly. A network dimensioning tool. Technical Report SC 96-49, Konrad-Zuse-Zentrum für Informationstechnik, 1996.
4. A. Balakrishnan and K. Altinkemer. Using a hop-constrained model to generate alternative communication network design. ORSA Journal on Computing, 4:192–205, 1992.
5. J. Beasley. An algorithm for the Steiner problem in graphs. Networks, 14:147–159, 1984.