Geodesic
Minimal rectilinear Steiner trees
Diskretnaya Matematika, Tome 1 (1989) no. 2, pp. 28-37 
A. F. Sidorenko. Minimal rectilinear Steiner trees. Diskretnaya Matematika, Tome 1 (1989) no. 2, pp. 28-37. http://geodesic.mathdoc.fr/item/DM_1989_1_2_a2/
@article{DM_1989_1_2_a2,
     author = {A. F. Sidorenko},
     title = {Minimal rectilinear {Steiner} trees},
     journal = {Diskretnaya Matematika},
     pages = {28--37},
     year = {1989},
     volume = {1},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1989_1_2_a2/}
}
TY  - JOUR
AU  - A. F. Sidorenko
TI  - Minimal rectilinear Steiner trees
JO  - Diskretnaya Matematika
PY  - 1989
SP  - 28
EP  - 37
VL  - 1
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_1989_1_2_a2/
LA  - ru
ID  - DM_1989_1_2_a2
ER  - 
%0 Journal Article
%A A. F. Sidorenko
%T Minimal rectilinear Steiner trees
%J Diskretnaya Matematika
%D 1989
%P 28-37
%V 1
%N 2
%U http://geodesic.mathdoc.fr/item/DM_1989_1_2_a2/
%G ru
%F DM_1989_1_2_a2

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider the problem of constructing a minimal rectilinear Steiner tree for $n$ points on the plane. We prove a number of properties of these trees and describe a fast algorithm for solving this problem for $n\leqslant11$. We give a general solution for $n\leqslant6$.