✦ LIBER ✦

Computing euclidean maximum spanning trees

✍ Scribed by Clyde Monma; Michael Paterson; Subhash Suri; Frances Yao

Publisher: Springer
Year: 1990
Tongue: English
Weight: 756 KB
Volume: 5
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01840396

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Euclidean Bounded-Degree Spanning Tree R

Euclidean Bounded-Degree Spanning Tree Ratios

✍ Timothy M. Chan 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 254 KB

Computing capacitated minimal spanning t

Computing capacitated minimal spanning trees efficiently

✍ A. Kershenbaum 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB

Finding minimal spanning trees in a eucl

Finding minimal spanning trees in a euclidean coordinate space

✍ O. Nevalainen; J. Ernvall; J. Katajainen 📂 Article 📅 1981 🏛 Springer Netherlands 🌐 English ⚖ 420 KB

Asymptotics for Euclidean minimal spanni

Asymptotics for Euclidean minimal spanning trees on random points

✍ David Aldous; J. Michael Steele 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 612 KB

A Parallel Algorithm for Computing Minim

A Parallel Algorithm for Computing Minimum Spanning Trees

✍ D.B. Johnson; P. Metaxas 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 840 KB

We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph \(G=(V, E)\) of \(n=|V|\) vertices and \(m=|E|\) edges on an EREW PRAM in \(O\left(\log ^{3 / 2} n\right)\) time using \(n+m\) processors. This represents a substantial improvement i

The maximum f-depth spanning tree proble

The maximum f-depth spanning tree problem

✍ Jérôme Monnot 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 113 KB

This paper deals with the problem of constructing directed trees of optimal weight and root r with depth at most f (|V |) (called f -depthDSTP r ). We first prove that the maximization and the minimization versions are equal-approximable under the differential ratio, that measures how the value of a