✦ LIBER ✦

Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

✍ Scribed by Czumaj, Artur; Ergün, Funda; Fortnow, Lance; Magen, Avner; Newman, Ilan; Rubinfeld, Ronitt; Sohler, Christian

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating the Minimum Spanning Tree

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

Estimating the Weight of Metric Minimum

✍ Czumaj, Artur; Sohler, Christian 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 266 KB

Kinetic Euclidean minimum spanning tree

✍ Rahmati, Zahed; Zarei, Alireza 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 230 KB

On the Complexity of Approximating Eucli

✍ G. Das; S. Kapoor; M. Smid 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 152 KB

Rate of convergence for the Euclidean mi

✍ Patrick Jaillet 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 353 KB

A Near-Tight Lower Bound on the Time Com

✍ Peleg, David; Rubinovich, Vitaly 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 250 KB