✦ LIBER ✦

A learning automata based approach to the bounded-diameter minimum spanning tree problem

✍ Scribed by Torkestani, Javad Akbari; Rezaei, Zahra

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree constrained minimum spanning tree

✍ Javad Akbari 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 701 KB

Approximating the Degree-Bounded Minimum

✍ Jochen Könemann; Asaf Levin; Amitabh Sinha 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 944 KB

An adaptive heuristic to the bounded-dia

✍ Akbari Torkestani, Javad 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 833 KB

Improved heuristics for the bounded-diam

✍ Alok Singh; Ashok K. Gupta 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 423 KB

A LEARNING AUTOMATA-BASED ALGORITHM TO T

✍ TORKESTANI, JAVAD AKBARI 📂 Article 📅 2013 🏛 World Scientific Publishing Company 🌐 English ⚖ 365 KB

A GRASP-based approach to the generalize

✍ Cristiane S. Ferreira; Luis Satoru Ochi; Víctor Parada; Eduardo Uchoa 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 880 KB