共 93 条
[1]
THE COMPLEXITY OF THE TRAVELING REPAIRMAN PROBLEM
[J].
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS,
1986, 20 (01)
:79-87
[2]
AFRATI F, 1999, P 40 ANN IEEE S FDN, P32
[3]
ALTHOFER I, 1993, DISCRETE COMPUTATION
[4]
[Anonymous], 2001, TION ENGRG
[5]
[Anonymous], 1996, CS9606 U VIRG
[6]
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[7]
[Anonymous], P CAMB PHILO SOC, DOI DOI 10.1017/S0305004100034095
[8]
Applegate D., 1998, DOC MATH J DTSCH MAT, P645
[10]
Arora S., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P106, DOI 10.1145/276698.276718