Geodesic
Approximation algorithms for the traveling salesman problem with range condition
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 3, pp. 173-181 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

@article{ITA_2000__34_3_173_0,
     author = {Arun Kumar, D. and Pandu Rangan, C.},
     title = {Approximation algorithms for the traveling salesman problem with range condition},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {173--181},
     year = {2000},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {3},
     mrnumber = {1796267},
     zbl = {0970.68196},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_2000__34_3_173_0/}
}
TY  - JOUR
AU  - Arun Kumar, D.
AU  - Pandu Rangan, C.
TI  - Approximation algorithms for the traveling salesman problem with range condition
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2000
SP  - 173
EP  - 181
VL  - 34
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_2000__34_3_173_0/
LA  - en
ID  - ITA_2000__34_3_173_0
ER  - 
%0 Journal Article
%A Arun Kumar, D.
%A Pandu Rangan, C.
%T Approximation algorithms for the traveling salesman problem with range condition
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2000
%P 173-181
%V 34
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_2000__34_3_173_0/
%G en
%F ITA_2000__34_3_173_0
Arun Kumar, D.; Pandu Rangan, C. Approximation algorithms for the traveling salesman problem with range condition. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 3, pp. 173-181. http://geodesic.mathdoc.fr/item/ITA_2000__34_3_173_0/