✦ LIBER ✦

An improved approximation algorithm for the clustered traveling salesman problem

✍ Scribed by Xiaoguang Bao; Zhaohui Liu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for the traveli

✍ Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 200 KB

An Algorithm for the Traveling Salesman

✍ Little, John D. C.; Murty, Katta G.; Sweeney, Dura W.; Karel, Caroline 📂 Article 📅 1963 🏛 INFORMS 🌐 English ⚖ 733 KB

An Improved Approximation Algorithm for

✍ Daisuke Yamaguchi; Shinji Imahori; Ryuhei Miyashiro; Tomomi Matsui 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 481 KB

Approximation Algorithms with Bounded Pe

✍ N. Guttmann-Beck; R. Hassin; S. Khuller; B. Raghavachari 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 111 KB

Approximation Algorithms for Multi-Crite

✍ Bodo Manthey; L. Shankar Ram 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 503 KB

An Effective Heuristic Algorithm for the

✍ Lin, S.; Kernighan, B. W. 📂 Article 📅 1973 🏛 INFORMS 🌐 English ⚖ 743 KB