✦ LIBER ✦

Euclidean minimum spanning trees and bichromatic closest pairs

✍ Scribed by Pankaj K. Agarwal; Herbert Edelsbrunner; Otfried Schwarzkopf; Emo Welzl

Book ID: 110561400
Publisher: Springer
Year: 1991
Tongue: English
Weight: 842 KB
Volume: 6
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02574698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic Euclidean minimum spanning trees

Dynamic Euclidean minimum spanning trees and extrema of binary functions

✍ D. Eppstein 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 714 KB

Kinetic Euclidean minimum spanning tree

Kinetic Euclidean minimum spanning tree in the plane

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

On the Complexity of Approximating Eucli

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees

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

Rate of convergence for the Euclidean mi

Rate of convergence for the Euclidean minimum spanning tree limit law

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

Balancing minimum spanning trees and sho

Balancing minimum spanning trees and shortest-path trees

✍ S. Khuller; B. Raghavachari; N. Young 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 897 KB

Approximating the Weight of the Euclidea

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

✍ Czumaj, Artur; Ergün, Funda; Fortnow, Lance; Magen, Avner; Newman, Ilan; Rubinfe 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 253 KB