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

๐Ÿ“

Steiner Minimal Trees

โœ Scribed by Dietmar Cieslik


Publisher
Springer, Berlin
Year
1998
Tongue
English
Leaves
328
Series
Nonconvex Optimization and Its Applications
Edition
1
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


  1. Introduction -- 2. SMT and MST in Metric Spaces -- A Survey -- 3. Fermat's Problem in Banach-Minkowski Spaces -- 4. The Degrees of the Vertices in Shortest Trees -- 5. 1-Steiner-Minimal-Trees -- 6. Methods to Construct Shortest Trees -- 7. The Steiner Ratio of Banach-Minkowski Spaces -- 8. Generalizations

๐Ÿ“œ SIMILAR VOLUMES


Advances in Steiner Trees
โœ J.H. Rubinstein ๐Ÿ“‚ Library ๐Ÿ“… 2000 ๐Ÿ› Springer ๐ŸŒ English

The Steiner ratio of finite-dimensional Lp spaces / J. Albrecht and D. Cieslik -- Shortest networks for one line and two points in space / R. Booth, D.A. Thomas, and J.F. Weng -- Rectilinear Steiner minimal trees on parallel lines / M. Brazil, D. Thomas, and J. Weng -- Computing shortest networks w

The Steiner Tree Problem
โœ Frank K. Hwang, Dana S. Richards, Pawel Winter ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› North-Holland ๐ŸŒ English

The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the ori

The Steiner Tree Problem
โœ Frank K. Hwang, Dana S. Richards and Pawel Winter (Eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Elsevier, Academic Press ๐ŸŒ English

The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the ori

The Steiner Tree Problem
โœ Frank K. Hwang, Dana S. Richards and Pawel Winter (Eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Elsevier, Academic Press ๐ŸŒ English

The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the ori

Advances in Steiner Trees
โœ Jens Albrecht, Dietmar Cieslik (auth.), Ding-Zhu Du, J. M. Smith, J. H. Rubinste ๐Ÿ“‚ Library ๐Ÿ“… 2000 ๐Ÿ› Springer US ๐ŸŒ English

<p>The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geomet

Steiner Trees in Industry
โœ Marcus Brazil (auth.), Xiu Zhen Cheng, Ding-Zhu Du (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English