✦ LIBER ✦

Kinetic Euclidean minimum spanning tree in the plane

✍ Scribed by Rahmati, Zahed; Zarei, Alireza

Book ID: 119292776
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 230 KB
Volume: 16
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.04.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Euclidean minimum spanning trees and bic

Euclidean minimum spanning trees and bichromatic closest pairs

✍ Pankaj K. Agarwal; Herbert Edelsbrunner; Otfried Schwarzkopf; Emo Welzl 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 842 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

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

Dynamic Euclidean minimum spanning trees

Dynamic Euclidean minimum spanning trees and extrema of binary functions

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

The Capacitated Minimum Spanning Tree

✍ K. M. Chandy; Tachen Lo 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract The capacitated minimum spanning tree is an offspring of the minimum spanning tree and network flow problems. It has application in the design of multipoint linkages in elementary teleprocessing tree networks. Some theorems are used in conjunction with Little's branch and bound algorith

Minimum-sum dipolar spanning tree in

✍ Steven Bitner; Ovidiu Daescu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 170 KB