✦ LIBER ✦

Approximating k-hop minimum-spanning trees

✍ Scribed by Ernst Althaus; Stefan Funke; Sariel Har-Peled; Jochen Könemann; Edgar A. Ramos; Martin Skutella

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum spanning tree with hop restricti

✍ Refael Hassin; Asaf Levin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Approximating Minimum Max-Stretch Spanni

✍ Emek, Yuval; Peleg, David 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 332 KB

Approximating Minimum-Size k -Connected

✍ Cheriyan, Joseph; Thurimella, Ramakrishna 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 397 KB

Approximating minimum spanning tree of d

✍ L. Alfandari; V.T. Paschos 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

Approximating minimum spanning tree of d

✍ Laurent Alfandari; Vangelis Th. Paschos 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

Drawing a tree as a minimum spanning tre

✍ Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 318 KB