✦ LIBER ✦

Approximating minimum spanning tree of depth 2

✍ Scribed by Laurent Alfandari; Vangelis Th. Paschos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating minimum spanning tree of d

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

Approximating the Degree-Bounded Minimum

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

Approximating minimum-cost graph problem

✍ Michel X. Goemans; David P. Williamson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Approximating the Minimum Spanning Tree

✍ Chazelle, Bernard; Rubinfeld, Ronitt; Trevisan, Luca 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 168 KB

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

Minimum spanning tree

✍ Cahit, I.; Cahit, R. 📂 Article 📅 1975 🏛 Institution of Electrical Engineers ⚖ 138 KB