Steiner Trees in Industry

✍ Scribed by Marcus Brazil (auth.), Xiu Zhen Cheng, Ding-Zhu Du (eds.)

Publisher: Springer US
Year: 2001
Tongue: English
Leaves: 508
Series: Combinatorial Optimization 11
Category: Library

No coin nor oath required. For personal study only.

✦ Table of Contents

Front Matter....Pages i-xi
Steiner Minimum Trees in Uniform Orientation Metrics....Pages 1-27
Genetic Algorithm Approaches to Solve Various Steiner Tree Problems....Pages 29-69
Neural Network Approaches to Solve Various Steiner Tree Problems....Pages 71-100
Steiner Tree Problems in VLSI Layout Designs....Pages 101-173
Polyhedral Approaches for the Steiner Tree Problem on Graphs....Pages 175-201
The Perfect Phylogeny Problem....Pages 203-234
Approximation Algorithms for the Steiner Tree Problem in Graphs....Pages 235-279
A Proposed Experiment on Soap Film Solutions of Planar Euclidean Steiner Trees....Pages 281-283
SteinLib: An Updated Library on Steiner Tree Problems in Graphs....Pages 285-325
Steiner Tree Based Distributed Multicast Routing in Networks....Pages 327-351
On Cost Allocation in Steiner Tree Networks....Pages 353-375
Steiner Trees and the Dynamic Quadratic Assignment Problem....Pages 377-403
Polynomial Time Algorithms for the Rectilinear Steiner Tree Problem....Pages 405-426
Minimum Networks for Separating and Surrounding Objects....Pages 427-439
A First Level Scatter Search Implementation for Solving the Steiner Ring Problem in Telecommunications Network Design....Pages 441-466
The Rectilinear Steiner Tree Problem: A Tutorial....Pages 467-507

✦ Subjects

Computer Communication Networks; Computer-Aided Engineering (CAD, CAE) and Design; Electrical Engineering; Theory of Computation; Evolutionary Biology

📜 SIMILAR VOLUMES

Advances in Steiner Trees

📁 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

Advances in Steiner Trees

📁 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 tree problems in computer commun

📁 Steiner tree problems in computer communication networks

✍ Dingzhu Du, Xiaodong Hu 📂 Library 📅 2008 🏛 World Scientific 🌐 English

Steiner Minimal Trees

📁 Steiner Minimal Trees

✍ Dietmar Cieslik 📂 Library 📅 1998 🏛 Springer, Berlin 🌐 English

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

The Steiner Tree Problem

📁 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

📁 The Steiner Tree Problem

✍ Frank K. Hwang, Dana S. Richards and Pawel Winter (Eds.) 📂 Library 📅 1992 🏛 Elsevier, Academic Press 🌐 English