## How Many Steiner Terminals Can You Connect in 20 Years?

Please always quote using this URN: urn:nbn:de:0297-zib-42524
• Steiner trees are constructed to connect a set of terminal nodes in a graph. This basic version of the Steiner tree problem is idealized, but it can effectively guide the search for successful approaches to many relevant variants, from both a theoretical and a computational point of view. This article illustrates the theoretical and algorithmic progress on Steiner tree type problems on two examples, the Steiner connectivity and the Steiner tree packing problem.

$Rev: 13581$