Improved Steiner Tree Algorithms for Bounded Treewidth

  • Markus Chimani
  • Petra Mutzel
  • Bernd Zey
Conference paper

DOI: 10.1007/978-3-642-25011-8_30

Volume 7056 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chimani M., Mutzel P., Zey B. (2011) Improved Steiner Tree Algorithms for Bounded Treewidth. In: Iliopoulos C.S., Smyth W.F. (eds) Combinatorial Algorithms. IWOCA 2011. Lecture Notes in Computer Science, vol 7056. Springer, Berlin, Heidelberg

Abstract

We propose a new algorithm that solves the Steiner tree problem on graphs with vertex set V to optimality in \(\ensuremath{\mathcal{O}(B_{\ensuremath{\textit{tw}}+2}^2 \cdot \ensuremath{\textit{tw}}\ \cdot |V|)}\) time, where \(\ensuremath{\textit{tw}}\) is the graph’s treewidth and the Bell numberBk is the number of partitions of a k-element set. This is a linear time algorithm for graphs with fixed treewidth and a polynomial algorithm for \(\ensuremath{\textit{tw}} = \ensuremath{\mathcal{O}(\log|V|/\log\log|V|)}\).

While being faster than the previously known algorithms, our thereby used coloring scheme can be extended to give new, improved algorithms for the prize-collecting Steiner tree as well as the k-cardinality tree problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Markus Chimani
    • 1
  • Petra Mutzel
    • 2
  • Bernd Zey
    • 2
  1. 1.Institute of Computer ScienceFriedrich-Schiller-University of JenaGermany
  2. 2.Department of Computer ScienceTUDortmundGermany