How Many Steiner Terminals Can You Connect in 20 Years?

Ralf Borndörfer (), Nam-Dũng Hoang (), Marika Karbstein (), Thorsten Koch () and Alexander Martin ()
Additional contact information
Ralf Borndörfer: Konrad-Zuse-Zentrum für Informationstechnik Berlin
Nam-Dũng Hoang: Vietnam National University, Faculty of Mathematics, Mechanics, and Informatics
Marika Karbstein: Konrad-Zuse-Zentrum für Informationstechnik Berlin
Thorsten Koch: Konrad-Zuse-Zentrum für Informationstechnik Berlin
Alexander Martin: Friedrich-Alexander-Universität Erlangen-Nürnberg, Department Mathematik

A chapter in Facets of Combinatorial Optimization, 2013, pp 215-244 from Springer

Abstract: 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.

Keywords: Greedy Algorithm; Steiner Tree; Steiner Tree Problem; Grid Graph; Node Disjoint (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-38189-8_10

Ordering information: This item can be ordered from
http://www.springer.com/9783642381898

DOI: 10.1007/978-3-642-38189-8_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().