1. A. O. Ivanov and A. A. Tuzhilin, “One-Dimensional Gromov Minimal Filling Problem,” Matem. Sbornik 203(5), 65 (2012) [Sbornik: Math. 203 (5), 677 (2012)].
2. M. R. Garey, R. L. Graham, and D. S. Johnson, “Some NP-Complete Geometric Problems,” in Proc. 8th Ann. ACM Symp. on the Theory of Computing (N.Y., 1976), pp. 10–22.
3. V. A. Emelichev, O. I. Mel’nikov, V. I. Sarvanov, and R. I. Tyshkevich, Lectures on Graph Theory (Nauka, Moscow, 1990) [in Russian].
4. J. H. Rubinstein and D. Thomas, “A Variational Approach to the Steiner Network Problem,” Ann. Oper. Res. 33, 481 (1991).
5. J. H. Rubinstein and D. Thomas, “The Steiner Ratio Conjecture for Six Points,” J. Combin. Theory, Ser. A 58, 54 (1991).