Advances in Steiner Trees

✍ Scribed by J.H. Rubinstein

Publisher: Springer
Year: 2000
Tongue: English
Leaves: 330
Series: COMBINATORIAL OPTIMIZATION Volume 6
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

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 with fixed topologies / T. Jiang and L. Wang -- Steiner trees, coordinate systems, and NP-hardness / J.F. Weng -- Exact algorithms for plane Steiner tree problems : a computational study / D.M. Warme, P. Winter, and M. Zachariasen -- On approximation of the power-p and bottleneck Steiner trees / P. Bierman and A. Zelikovsky -- Exact Steiner trees in graphs and grid graphs / S. Cheng -- Grade of service Steiner trees in series-parallel networks / C. Colbourn and G. Xue -- Preprocessing the Steiner problem in graphs / C. Duin -- A fully-polynomial approximation scheme for the Euclidean Steiner augmentation problem / J.S. Provan -- Effective local search techniques for the Steiner tree problem / Austin Wade and V.J. Rayward-Smith -- Modern heuristic search methods for the Steiner problem in graphs / S. Voss

📜 SIMILAR VOLUMES

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 Trees in Industry

📁 Steiner Trees in Industry

✍ Marcus Brazil (auth.), Xiu Zhen Cheng, Ding-Zhu Du (eds.) 📂 Library 📅 2001 🏛 Springer US 🌐 English

The Steiner Tree Problem: A Tour through

📁 The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (Advanced Lectures in Mathematics)

✍ Hans Jürgen Prömel, Angelika Steger 📂 Library 📅 2002 🏛 Vieweg+Teubner Verlag 🌐 English

In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity.

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