TY  - JOUR
AU  - A. E. Baburin
AU  - E. Kh. Gimadi
TI  - An approximate algorithm for finding a maximum-weight $d$-homogeneous connected spanning subgraph in a~complete graph with random edge weights
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2006
SP  - 3
EP  - 20
VL  - 13
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2006_13_2_a0/
LA  - ru
ID  - DA_2006_13_2_a0
ER  -