✦ LIBER ✦

The Euclidean travelling salesman problem is NP-complete

✍ Scribed by Christos H. Papadimitriou

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The adjacency relation on the traveling

✍ Christos H. Papadimitriou 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 621 KB

NP-completeness of the hamming salesman

✍ Jarmo Ernvall; Jyrki Katajainen; Martti Penttonen 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 211 KB

Probabilistic exchange algorithms and Eu

✍ Y. Rossier; M. Troyon; Th. M. Liebling 📂 Article 📅 1986 🏛 Springer 🌐 German ⚖ 918 KB

Genetically improved presequences for eu

✍ D.M. Tate; C. Tunasar; A.E. Smith 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 884 KB

Quantizers and the worst-case Euclidean

✍ Luis A. Goddyn 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 888 KB

A polynomial-time linear decision tree f

✍ Martin Kolinek 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 630 KB