✦ LIBER ✦

A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation

✍ Scribed by Wang, Zhaocai; Huang, Dongmei; Meng, Huajun; Tang, Chengpei

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A global optimization algorithm for solv

✍ Oleksii Ursulenko, Sergiy Butenko, Oleg A. Prokopyev 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 300 KB

On symbolic OBDD-based algorithms for th

✍ Beate Bollig 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A new algorithm for degree-constrained m

✍ Aibing Ning; Liang Ma; Xiaohua Xiong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 163 KB

A one-parameter genetic algorithm for th

✍ Yupei Xiong; Golden, B.; Wasil, E. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 410 KB

A hybrid algorithm based on tabu search

✍ Hideki Katagiri; Tomohiro Hayashida; Ichiro Nishizaki; Qingqiang Guo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 536 KB

[Lecture Notes in Computer Science] Know

✍ Negoita, Mircea Gh.; Howlett, Robert J.; Jain, Lakhmi C. 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 119 KB