Information Journal Paper
APA:
CopyPAPADIMITRIOU, C.. (1977). THE EUCLIDEAN TRAVELLING SALESMAN PROBLEM IS NP-COMPLETE. THEORETICAL COMPUTER SCIENCE, 4(3), 237-244. SID. https://sid.ir/paper/596323/en
Vancouver:
CopyPAPADIMITRIOU C.. THE EUCLIDEAN TRAVELLING SALESMAN PROBLEM IS NP-COMPLETE. THEORETICAL COMPUTER SCIENCE[Internet]. 1977;4(3):237-244. Available from: https://sid.ir/paper/596323/en
IEEE:
CopyC. PAPADIMITRIOU, “THE EUCLIDEAN TRAVELLING SALESMAN PROBLEM IS NP-COMPLETE,” THEORETICAL COMPUTER SCIENCE, vol. 4, no. 3, pp. 237–244, 1977, [Online]. Available: https://sid.ir/paper/596323/en