The problem of finding the shortest connecting tree with a constraint
Diskretnyj analiz i issledovanie operacij, no. 15 (1976), pp. 40-47.

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

@article{DA_1976_15_a4,
     author = {S. A. Morozov},
     title = {The problem of finding the shortest connecting tree with a constraint},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {40--47},
     publisher = {mathdoc},
     number = {15},
     year = {1976},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1976_15_a4/}
}
TY  - JOUR
AU  - S. A. Morozov
TI  - The problem of finding the shortest connecting tree with a constraint
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1976
SP  - 40
EP  - 47
IS  - 15
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1976_15_a4/
LA  - ru
ID  - DA_1976_15_a4
ER  - 
%0 Journal Article
%A S. A. Morozov
%T The problem of finding the shortest connecting tree with a constraint
%J Diskretnyj analiz i issledovanie operacij
%D 1976
%P 40-47
%N 15
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1976_15_a4/
%G ru
%F DA_1976_15_a4
S. A. Morozov. The problem of finding the shortest connecting tree with a constraint. Diskretnyj analiz i issledovanie operacij, no. 15 (1976), pp. 40-47. http://geodesic.mathdoc.fr/item/DA_1976_15_a4/