The complexity of the travelling repairman problem
Afrati, Foto ; Cosmadakis, Stavros ; Papadimitriou, Christos H. ; Papageorgiou, George ; Papakostantinou, Nadia
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986), p. 79-87 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1986-01-01
@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},
     volume = {20},
     year = {1986},
     pages = {79-87},
     mrnumber = {849967},
     zbl = {0585.68057},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 79-87. http://gdmltest.u-ga.fr/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 519066 | Zbl 0411.68039

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