[1| AHO A. V., GAREY M. R., HWANG F. K: Rectilinear Steiner trees: Efficient special case algorithms. Networks 7, 1977, 37-58. MR 0464663 | Zbl 0351.05102

[2] BERGE C.: Graphs and hypergraphs. North-Holland, Amsterdam 1973. MR 0357172 | Zbl 0254.05101

[3] BORŮVKA O.: O jistém problému minimálním. Práce moravské přírodovědecké společnosti 3, 1926, 37-58.

[4] CHRISTOFIDES N.: Graph theory - An algorithmic approach. Academic Press, London 1975. MR 0429612 | Zbl 0321.94011

[5] CHRISTOFIDES N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Math. Programming, to appear.

[6] CHUNG F. R. K., GILBERT E. N.: Steiner trees for the regular simplex. Bull. Inst. Math. Acad. Sinica 4, 1976, 313-325. MR 0505711 | Zbl 0351.05103

[7] CHUNG F. R. K., HWANG F. K.: A lower bound for the Steiner tree problem. SIAM J. appl. Math. 34, 1978, 27-36. MR 0482833 | Zbl 0376.05020

[8] ČULÍK K., DOLEŽAL V., FIEDLER M.: Kombinatorická analýza v praxi. SNTL - Nakladatelstvi technicke literatury, Praha 1967.

[9] DREYFUS S. E., WAGNER R. A.: The Steiner problem in graphs. Networks 1, 1971, 194-207. MR 0297107

[10] GAREY M. R., GRAHAM R. L., JOHNSON D. S.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32, 1977, 835-859. MR 0443427 | Zbl 0399.05023

[11] GAREY M. R., JOHNSON D. S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 1977, 826-834. MR 0443426 | Zbl 0396.05009

[12] GILBERT E. N., POLLAK H. O.: Steiner minimal trees. SIAM J. Appl. Math. 16, 1968, 1-29. MR 0223269 | Zbl 0159.22001

[13] GRAHAM R. L., HWANG F. K.: Remarks on Steiner minimal trees I. Bull. Inst. Math. Acad. Sinica 4, 1976, 177-182. MR 0437371

[14] HAKIMI S.L.: Steiner's problem in graphs and its implications. Networks 1, 1971, 113-133. MR 0295947 | Zbl 0229.05124

[15] HANAN M.: On Steiner's problem with rectilinear distance. SIAM J. Appl. Math. 14, 1966, 255-265. MR 0224500 | Zbl 0151.33205

[16] HWANG F. K.: On Steiner minimal trees with rectilinear distance. SIAM J. Appl. Math. 30, 1976, 104-114. MR 0389632 | Zbl 0322.05101

[17] JARNÍK V., KOSSLER M.: O minimálních grafech obsahujicích n daných bodů. Časopis Pěst. Mat. Fys. 63, 1934, 223-235. MR 1829832

[18] KARP R. M.: Reducibility among combinatorial problems. In: Complexity of computer computations (R. E. Miller a and J. W. Thatcher, eds.) Plenum Press, New York 1972, 85-104. MR 0378476

[19] ROSENKRANTZ D. J., STEARNS R. E., LEWIS P. M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6, 1977, 563-581. MR 0459617 | Zbl 0364.90104

[20] TARJAN R. E.: Depth-first search and linear graph algorithms. SIAM J. Computing 1, 1972, 146-160. MR 0304178 | Zbl 0251.05107