✦ LIBER ✦

Lagrangean bounds for the optimum communication spanning tree problem

✍ Scribed by Ivan Contreras; Elena Fernández; Alfredo Marín

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for the optimum communication

✍ Prabha Sharma 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 193 KB

A Lagrangean approach to the degree-cons

✍ A. Volgenant 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 451 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

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

RAMP for the capacitated minimum spannin

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