MathSciNet Relay Station
MathSciNet bibliographic data
MR455550 68A20 (90B10)
Papadimitriou, Christos H. The Euclidean traveling salesman problem is $NP$-complete. Theoret. Comput. Sci. 4 (1977), no. 3, 237–244.
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2017, American Mathematical Society
Privacy Statement