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

On Steiner trees for bounded point sets

โœ Scribed by F. R. K. Chung; R. L. Graham

Publisher
Springer
Year
1981
Tongue
English
Weight
304 KB
Volume
11
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

๐Ÿ“œ 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