The complexity of the travelling repairman problem
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 1, pp. 79-87.
@article{ITA_1986__20_1_79_0,
     author = {Afrati, Foto and Cosmadakis, Stavros and Papadimitriou, Christos H. and Papageorgiou, George and Papakostantinou, Nadia},
     title = {The complexity of the travelling repairman problem},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {79--87},
     publisher = {AFCET - Gauthier-Villars},
     address = {Paris},
     volume = {20},
     number = {1},
     year = {1986},
     mrnumber = {849967},
     zbl = {0585.68057},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1986__20_1_79_0/}
}
TY  - JOUR
AU  - Afrati, Foto
AU  - Cosmadakis, Stavros
AU  - Papadimitriou, Christos H.
AU  - Papageorgiou, George
AU  - Papakostantinou, Nadia
TI  - The complexity of the travelling repairman problem
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1986
SP  - 79
EP  - 87
VL  - 20
IS  - 1
PB  - AFCET - Gauthier-Villars
PP  - Paris
UR  - http://www.numdam.org/item/ITA_1986__20_1_79_0/
LA  - en
ID  - ITA_1986__20_1_79_0
ER  - 
%0 Journal Article
%A Afrati, Foto
%A Cosmadakis, Stavros
%A Papadimitriou, Christos H.
%A Papageorgiou, George
%A Papakostantinou, Nadia
%T The complexity of the travelling repairman problem
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1986
%P 79-87
%V 20
%N 1
%I AFCET - Gauthier-Villars
%C Paris
%U http://www.numdam.org/item/ITA_1986__20_1_79_0/
%G en
%F ITA_1986__20_1_79_0
Afrati, Foto; Cosmadakis, Stavros; Papadimitriou, Christos H.; Papageorgiou, George; Papakostantinou, Nadia. The complexity of the travelling repairman problem. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 1, pp. 79-87. http://www.numdam.org/item/ITA_1986__20_1_79_0/

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and co., San Francisco, 1979. | MR | Zbl

2. S. Sahni and T. Gonzales, P-Complete Approximation Problems, J. Assoc. Comput. Mach., Vol. 23, 1976, pp. 555-565. | MR | Zbl