<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>4252</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2013-09-20</completedDate>
    <publishedDate>2013-09-20</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">How Many Steiner Terminals Can You Connect in 20 Years?</title>
    <abstract language="eng">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.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-42524</identifier>
    <identifier type="doi">10.1007/978-3-642-38189-8_10</identifier>
    <enrichment key="SourceTitle">Appeared in: Facets of Combinatorial Optimization  Festschrift for Martin Grötschel.  Jünger, Michael; Reinelt, Gerhard (Eds.) Springer 2013, pp. 215-244</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Nam-Dung Hoang</author>
    <author>Marika Karbstein</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-57</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Steiner tree</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Steiner connectivity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Steiner tree packing</value>
    </subject>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C35">Programming involving graphs or networks [See also 90C27]</collection>
    <collection role="msc" number="90C90">Applications of mathematical programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/4252/ZR_13_57.pdf</file>
  </doc>
</export-example>
