Advances in Steiner trees / edited by Ding-Zhu Du, J.M. Smith, and J.H. Rubinstein.
This book presents an up-to-date set of contributions by the most influential authors on the Steiner Tree problem. The authors address the latest concerns of Steiner Trees for their computational complexity, design of algorithms, performance guaranteed heuristics, computational experimentation, and...
Saved in:
| Online Access: |
Full Text (via Springer) |
|---|---|
| Other Authors: | , , |
| Format: | eBook |
| Language: | English |
| Published: |
Dordrecht ; Boston :
Kluwer Academic Publishers,
[2000]
|
| Series: | Combinatorial optimization ;
v. 6. |
| Subjects: |
Table of Contents:
- 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.