How Many Steiner Terminals Can You Connect in 20 Years?

Borndörfer R, Hoang ND, Karbstein M, Koch T, Martin A (2013)


Publication Language: English

Publication Type: Book chapter / Article in edited volumes

Publication year: 2013

Publisher: Springer

Edited Volumes: Facets of Combinatorial Optimization

Pages Range: 215--244

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.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Borndörfer, R., Hoang, N.D., Karbstein, M., Koch, T., & Martin, A. (2013). How Many Steiner Terminals Can You Connect in 20 Years? In Michael JÜnger and Gerhard Reinelt (Eds.), Facets of Combinatorial Optimization. (pp. 215--244). Springer.

MLA:

Borndörfer, Ralf, et al. "How Many Steiner Terminals Can You Connect in 20 Years?" Facets of Combinatorial Optimization. Ed. Michael JÜnger and Gerhard Reinelt, Springer, 2013. 215--244.

BibTeX: Download