✦ LIBER ✦

An adaptive heuristic to the bounded-diameter minimum spanning tree problem

✍ Scribed by Akbari Torkestani, Javad

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved heuristics for the bounded-diam

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

Approximating the Degree-Bounded Minimum

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

A hybrid heuristic for the diameter cons

✍ Abilio Lucena; Celso C. Ribeiro; Andréa C. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 363 KB

Greedy heuristics for the diameter-const

✍ C. Requejo; E. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 385 KB

On the minimum diameter spanning tree pr

✍ Refael Hassin; Arie Tamir 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 199 KB

The non-uniform Bounded Degree Minimum D

✍ Chawachat, Jakarin; Fakcharoenphol, Jittat; Jindaluang, Wattana 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 158 KB