๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A class of full Steiner minimal trees

โœ Scribed by F.K. Hwang; Jia Feng Weng; Ding Zhu Du

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
559 KB
Volume
45
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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).

๐Ÿ“œ SIMILAR VOLUMES

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

Minimal Steiner Trees for Rectangular Ar
Minimal Steiner Trees for Rectangular Arrays of Lattice Points
โœ M Brazil; J.H Rubinstein; D.A Thomas; J.F Weng; N.C Wormald ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 619 KB

We construct minimal Steiner trees for any square or rectangular array of integer lattice points on the Euclidean plane. 1997 Academic Press ## 1. INTRODUCTION AND PRELIMINARIES This paper answers a series of questions raised by Chung et al. in [3] on the length of the shortest network interconne