scientific article
From MaRDI portal
Publication:3210200
zbMath0722.68088MaRDI QIDQ3210200
Bernhard Korte, Angelika Steger, Hans Jürgen Prömel
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Circuits, networks (94C99) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (19)
The rectilinear class Steiner tree problem for intervals on two parallel lines ⋮ Comparison of formulations and a heuristic for packing Steiner trees in a graph ⋮ A better constant-factor approximation for selected-internal Steiner minimum tree ⋮ Packing Steiner trees with identical terminal sets ⋮ Computing optimal Steiner trees in polynomial space ⋮ Packing Steiner trees: Polyhedral investigations ⋮ Extending the kernel for planar Steiner tree to the number of Steiner vertices ⋮ On the complexity of the bilevel minimum spanning tree problem ⋮ Steiner tree packing revisited ⋮ (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ Faster Steiner Tree Computation in Polynomial-Space ⋮ An Efficient Approximation Algorithm for the Steiner Tree Problem ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ Construction of the current Steiner network of the second optimality rank ⋮ Variable neighbourhood search for the minimum labelling Steiner tree problem ⋮ Parameterized Complexity of Directed Steiner Tree on Sparse Graphs ⋮ Switchbox routing in VLSI design: Closing the complexity gap ⋮ Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
This page was built for publication:
