Advances in Steiner Trees

by Ding-Zhu Du (Editor)

Preface. The Steiner Ratio of finite-dimensional Lp Spaces; J. Albrecht, D. Cieslik. Shortest Networks for One line and Two Points in Space; R. Booth, et al. Rectilinear Steiner Minimal Trees on Parallel Lines; M. Brazil, et al. Computing Shortest Networks with Fixed Topologies; T. Jiang, L. Wang. Steiner Trees, Coordinate Systems, and NP-Hardness; J.F. Weng. Exact Algorithms for Plane Steiner Tree A Computational Study; D.M. Warme, et al. On Approximation of the Power-p and Bottleneck Steiner Trees; P. Bierman, A. Zelikovsky. Exact Steiner Trees in Graphs and Grid Graphs; S. Cheng. Grade of Service Steiner Trees in Series-Parallel Networks; C. Colbourn, G. Xue. Preprocessing the Steiner Problem in Graphs; C. Duin. A Fully-Polynomial Approximation Scheme for the Euclidean Steiner Augmentation Problem; J.C. Provan. Effective Local Search Techniques for the Steiner Tree Problem; A. Wade, V.J. Rayward-Smith. Modern Heuristic Search Methods for the Steiner Problem in Graphs; S. Voss.

336 pages, Paperback

First published January 1, 2000