TY  - JOUR
AU  - E. Kh. Gimadi
TI  - The traveling salesman problem on a maximum: conditions for the asymptotic accuracy of the algorithm “go to the most remote city”
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1989
SP  - 11
EP  - 15
IS  - 29
UR  - http://geodesic.mathdoc.fr/item/DA_1989_29_a1/
LA  - ru
ID  - DA_1989_29_a1
ER  -