Tree Decomposition based Steiner Tree Computation over Large Graphs
Fang Wei-Kleiner · arXiv (Cornell University) · 2013
In this paper, we present an exact algorithm for the Steiner tree problem. The algorithm is based on certain pre-computed index structures. Our algorithm offers a practical solution for the Steiner tree problems on graphs of large size and bounded number of terminals.