✦ LIBER ✦

A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees

✍ Scribed by Könemann, J.; Ravi, R.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating the Degree-Bounded Minimum

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

Comparison of Algorithms for the Degree

✍ Mohan Krishnamoorthy; Andreas T. Ernst; Yazid M. Sharaiha 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 163 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

A Network-Flow Technique for Finding Low

✍ Sándor P Fekete; Samir Khuller; Monika Klemmstein; Balaji Raghavachari; Neal You 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 195 KB

A new algorithm for degree-constrained m

✍ Aibing Ning; Liang Ma; Xiaohua Xiong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 163 KB

A fast distributed approximation algorit

✍ Maleq Khan; Gopal Pandurangan 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 271 KB