Abstract
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.
Cite
CITATION STYLE
Borndörfer, R., Hoang, N. D., Karbstein, M., Koch, T., & Martin, A. (2013). How many steiner terminals can you connect in 20 years? In Facets of Combinatorial Optimization: Festschrift for Martin Grötschel (Vol. 9783642381898, pp. 215–244). Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/978-3-642-38189-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
