%0 Journal Article
%A A. E. Baburin
%A E. Kh. Gimadi
%T An approximate algorithm for finding a maximum-weight $d$-homogeneous connected spanning subgraph in a~complete graph with random edge weights
%J Diskretnyj analiz i issledovanie operacij
%D 2006
%P 3-20
%V 13
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2006_13_2_a0/
%G ru
%F DA_2006_13_2_a0