✦ LIBER ✦

Improved heuristics for the bounded-diameter minimum spanning tree problem

✍ Scribed by Alok Singh; Ashok K. Gupta

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Greedy heuristics for the diameter-const

✍ C. Requejo; E. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 385 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

On the minimum diameter spanning tree pr

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

RAMP for the capacitated minimum spannin

✍ Cesar Rego; Frank Mathew; Fred Glover 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 419 KB

Improved heuristics for the minimum weig

✍ Yinfeng Xu; Dian Zhou 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 638 KB