✦ LIBER ✦

Drawing a tree as a minimum spanning tree approximation

✍ Scribed by Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating k-hop minimum-spanning tre

✍ Ernst Althaus; Stefan Funke; Sariel Har-Peled; Jochen Könemann; Edgar A. Ramos; 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 231 KB

A probabilistic minimum spanning tree al

✍ F. James Rohlf 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 776 KB

A fast distributed approximation algorit

✍ Maleq Khan; Gopal Pandurangan 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 271 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

Minimum-cost spanning tree as a path-fin

✍ Bruce M. Maggs; Serge A. Plotkin 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 325 KB