Geodesic
Certain generalization of the maximum traveling salesman problem
Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 3, pp. 3-12

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

The problem is considered of finding in a complete undirected weighted graph a connected spanning subgraph with the given degrees of the vertices having maximum total weight of the edges. An approximate polynomial algorithm is presented for this problem. The algorithm is analyzed, and some upper bounds of its error are established in the general case as well as in the metric and Euclidean cases. 
@article{DA_2006_13_3_a0,
     author = {A. E. Baburin and E. Kh. Gimadi},
     title = {Certain generalization of the maximum traveling salesman problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--12},
     publisher = {mathdoc},
     volume = {13},
     number = {3},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2006_13_3_a0/}
}
TY  - JOUR
AU  - A. E. Baburin
AU  - E. Kh. Gimadi
TI  - Certain generalization of the maximum traveling salesman problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2006
SP  - 3
EP  - 12
VL  - 13
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2006_13_3_a0/
LA  - ru
ID  - DA_2006_13_3_a0
ER  - 
%0 Journal Article
%A A. E. Baburin
%A E. Kh. Gimadi
%T Certain generalization of the maximum traveling salesman problem
%J Diskretnyj analiz i issledovanie operacij
%D 2006
%P 3-12
%V 13
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2006_13_3_a0/
%G ru
%F DA_2006_13_3_a0
A. E. Baburin; E. Kh. Gimadi. Certain generalization of the maximum traveling salesman problem. Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 3, pp. 3-12. http://geodesic.mathdoc.fr/item/DA_2006_13_3_a0/