✦ LIBER ✦

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

✍ Scribed by Jochen Könemann; Asaf Levin; Amitabh Sinha

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

On the minimum diameter spanning tree pr

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

Lower and upper bounds for the degree-co

✍ Alexandre Salles da Cunha; Abilio Lucena 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

Greedy heuristics for the diameter-const

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

Edge exchanges in the degree-constrained

✍ Martin Savelsbergh; Ton Volgenant 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A hybrid heuristic for the diameter cons

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