𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Euclidean Bottleneck Full Steiner Tree Problem

✍ Scribed by Abu-Affash, A. Karim

Book ID
120910095
Publisher
Springer
Year
2013
Tongue
English
Weight
555 KB
Volume
71
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The full Steiner tree problem
The full Steiner tree problem
✍ Chin Lung Lu; Chuan Yi Tang; Richard Chia-Tung Lee πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 358 KB

Motivated by the reconstruction of phylogenetic tree in biology, we study the full Steiner tree problem in this paper. Given a complete graph G = (V; E) with a length function on E and a proper subset R βŠ‚ V , the problem is to ΓΏnd a full Steiner tree of minimum length in G, which is a kind of Steine

An approximation algorithm for a bottlen
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
✍ Lusheng Wang; Zimao Li πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 95 KB

We study a bottleneck Steiner tree problem: given a set P = {p 1 , p 2 , . . . , p n } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in