Geodesic
Reconstruction of norm by geometry of minimal networks
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2016), pp. 53-56

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

The inverse problem to the Steiner minimal tree searching problem in a normed space is studied. Namely, let a normed space be given and all Steiner minimal trees be known in this space. The problem is to describe all norms with the same minimal Steiner trees for all finite boundary sets as determined in a given space. The paper presents a review of known results on the question and announces the uniqueness of the set of Steiner minimal trees for any two-dimensional space with a strongly convex and differentiable norm. 
@article{VMUMM_2016_2_a10,
     author = {I. L. Laut},
     title = {Reconstruction of norm by geometry of minimal networks},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {53--56},
     publisher = {mathdoc},
     number = {2},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2016_2_a10/}
}
TY  - JOUR
AU  - I. L. Laut
TI  - Reconstruction of norm by geometry of minimal networks
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2016
SP  - 53
EP  - 56
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2016_2_a10/
LA  - ru
ID  - VMUMM_2016_2_a10
ER  - 
%0 Journal Article
%A I. L. Laut
%T Reconstruction of norm by geometry of minimal networks
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2016
%P 53-56
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2016_2_a10/
%G ru
%F VMUMM_2016_2_a10
I. L. Laut. Reconstruction of norm by geometry of minimal networks. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2016), pp. 53-56. http://geodesic.mathdoc.fr/item/VMUMM_2016_2_a10/