scientific article; zbMATH DE number 970831
From MaRDI portal
Publication:5689037
zbMath0992.68156MaRDI QIDQ5689037
Hans Jürgen Prömel, Angelika Steger
Publication date: 23 January 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithms in computer science (68Wxx) Graph theory (including graph drawing) in computer science (68R10) Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree ⋮ Approximation schemes for node-weighted geometric Steiner tree problems ⋮ Computing optimal Steiner trees in polynomial space ⋮ Approximate Euclidean Steiner trees ⋮ Extending the kernel for planar Steiner tree to the number of Steiner vertices ⋮ A tutorial on the balanced minimum evolution problem ⋮ Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ Steiner tree reoptimization in graphs with sharpened triangle inequality ⋮ Reoptimization of Steiner Trees ⋮ The Steiner connectivity problem ⋮ Wildlife corridors as a connected subgraph problem ⋮ On the edge capacitated Steiner tree problem ⋮ Faster Steiner Tree Computation in Polynomial-Space ⋮ Steiner's invariants and minimal connections ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ A partition-based relaxation for Steiner trees ⋮ Algorithmic aspects of Steiner convexity and enumeration of Steiner trees ⋮ The Steiner forest problem revisited ⋮ Geodesics and flows in a Poissonian city ⋮ A near linear time approximation scheme for Steiner tree among obstacles in the plane ⋮ The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem ⋮ Unnamed Item ⋮ On the Hardness of Reoptimization ⋮ Parameterized Complexity of Directed Steiner Tree on Sparse Graphs ⋮ Unnamed Item ⋮ Approaches to the Steiner Problem in Networks ⋮ Multi-level Steiner Trees ⋮ Unnamed Item ⋮ Multi-Level Steiner Trees.
