The complexity of the travelling repairman problem
Foto Afrati; Stavros Cosmadakis; Christos H. Papadimitriou; George Papageorgiou; Nadia Papakostantinou
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1986)
- Volume: 20, Issue: 1, page 79-87
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 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. Zbl0411.68039MR519066
- 2. S. SAHNI and T. GONZALES, P-Complete Approximation Problems, J. Assoc. Comput. Mach., Vol. 23, 1976, pp. 555-565. Zbl0348.90152MR408313