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

Steiner Minimal Trees on Chinese Checkerboards

โœ Scribed by F. K. Hwang and D. Z. Du


Book ID
120610258
Publisher
Mathematical Association of America
Year
1991
Tongue
English
Weight
498 KB
Volume
64
Category
Article
ISSN
0025-570X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Full Minimal Steiner Trees on Lattice Se
โœ 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