✦ LIBER ✦

A 2.75-approximation algorithm for the unconstrained traveling tournament problem

✍ Scribed by Shinji Imahori,Tomomi Matsui,Ryuhei Miyashiro

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for the trave

✍ Ryuhei Miyashiro; Tomomi Matsui; Shinji Imahori 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 347 KB

An Improved Approximation Algorithm for

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

A 5.875-approximation for the Traveling

✍ Stephan Westphal,Karl Noparlik 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 503 KB

A simulated annealing and hill-climbing

✍ A. Lim; B. Rodrigues; X. Zhang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Improved approximation algorithm for the

✍ Prashant Sasatte 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 391 KB

Approximation algorithms for the traveli

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