Advances in Steiner trees (Q1966103)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Albrecht, Jens; Cieslik, Dietmar}, The Steiner ratio of finite-dimensional \({\mathcal L}_p\)-spaces, 1-13 [Zbl 0952.05016] \textit{Booth, R. S.; Thomas, D. A.; Weng, J. F.}, Shortest networks for one line and two points in space, 15-26 [Zbl 0945.90023] \textit{Brazil, Marcus; Thomas, Doreen A.; Weng, Jia Feng}, Rectilinear Steiner minimal trees on parallel lines, 27-37 [Zbl 0944.05020] \textit{Jiang, Tao; Wang, Lusheng}, Computing shortest networks with fixed topologies, 39-62 [Zbl 0947.68117] \textit{Weng, J. F.}, Steiner trees, coordinate systems and NP-hardness, 63-80 [Zbl 0981.68120] \textit{Warme, D. M.; Winter, P.; Zachariasen, M.}, Exact algorithms for plane Steiner tree problems: A computational study, 81-116 [Zbl 0968.90067] \textit{Berman, Piotr; Zelikovsky, Alexander}, On approximation of the power-\(p\) and bottleneck Steiner trees, 117-135 [Zbl 0945.90046] \textit{Cheng, Siu-Wing}, Exact Steiner trees in graphs and grid graphs, 137-162 [Zbl 0981.68121] \textit{Colbourn, Charles J.; Xue, Guoliang}, Grade of service Steiner trees in series-parallel networks, 163-174 [Zbl 0945.90047] \textit{Duin, Cees}, Preprocessing the Steiner problem in graphs, 175-233 [Zbl 0945.90029] \textit{Provan, J. Scott}, A fully polynomial approximation scheme for the Euclidean Steiner augmentation problem, 235-253 [Zbl 0947.68118] \textit{Wade, A. S. C.; Rayward-Smith, V. J.}, Effective local search techniques for the Steiner tree problem, 255-281 [Zbl 0959.90055] \textit{Voß, Stefan}, Modern heuristic search methods for the Steiner tree problem in graphs, 283-323 [Zbl 0998.90068]