✦ LIBER ✦

Weighted nearest neighbor algorithms for the graph exploration problem on cycles

✍ Scribed by Yuichi Asahiro; Eiji Miyano; Shuichi Miyazaki; Takuro Yoshimuta

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Effective algorithms for the nearest nei

✍ Kazuo Hattori; Yasunobu Torii 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 494 KB

AnO(nlogn) algorithm for the all-nearest

✍ Pravin M. Vaidya 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 925 KB

Efficient algorithms for computing two n

✍ Tzong-Wann Kao; Shi-Jinn Horng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 782 KB

On the study of nearest neighbor algorit

✍ Jose Barranquero; Pablo González; Jorge Díez; Juan José del Coz 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 735 KB

On the nearest neighbor rule for the tra

✍ Cor A.J. Hurkens; Gerhard J. Woeginger 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 227 KB

New algorithms for the weighted maximum

✍ N. Z. Shor; O. A. Berezovskii 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 360 KB