✦ LIBER ✦

Analytic formulas for full steiner trees

✍ Scribed by R. S. Booth

Book ID: 110561380
Publisher: Springer
Year: 1991
Tongue: English
Weight: 403 KB
Volume: 6
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02574675

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Rectilinear full Steiner tree generation

✍ Zachariasen, Martin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 353 KB

The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First, a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic

A linear time algorithm for full steiner

A linear time algorithm for full steiner trees

✍ F.K Hwang 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Symmetrization theorem of full steiner t

Symmetrization theorem of full steiner trees

✍ Jia Feng Weng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 283 KB

A class of full Steiner minimal trees

✍ F.K. Hwang; Jia Feng Weng; Ding Zhu Du 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 559 KB

Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using Eines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one).

Full Minimal Steiner Trees on Lattice Se

Full Minimal Steiner Trees on Lattice Sets

✍ M. Brazil; J.H. Rubinstein; D.A. Thomas; J.F. Weng; N.C. Wormald 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 497 KB

Given a finite set of points P in the Euclidean plane, the Steiner problem asks us to constuct a shortest possible network interconnecting P. Such a network is known as a minimal Steiner tree. The Steiner problem is an intrinsically difficult one, having been shown to be NP-hard [7]; however, it oft