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

Approximations for Steiner Trees with Minimum Number of Steiner Points

โœ Scribed by DONGHUI CHEN; DING-ZHU DU; XIAO-DONG HU; GUO-HUI LIN; LUSHENG WANG; GUOLIANG XUE

Book ID
110263375
Publisher
Springer US
Year
2000
Tongue
English
Weight
156 KB
Volume
18
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximating the Minimum-Degree Steiner
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
โœ M. Furer; B. Raghavachari ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 691 KB

The problem of constructing a spanning tree for a graph \(G=(V, E)\) with \(n\) vertices whose maximal degree is the smallest among all spanning trees of \(G\) is considered. This problem is easily shown to be NP-hard. In the Steiner version of this problem, along with the input graph, a set of dist

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