English

Tree Decomposition based Steiner Tree Computation over Large Graphs

Data Structures and Algorithms 2013-05-27 v1

Abstract

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.

Keywords

Cite

@article{arxiv.1305.5757,
  title  = {Tree Decomposition based Steiner Tree Computation over Large Graphs},
  author = {Fang Wei-Kleiner},
  journal= {arXiv preprint arXiv:1305.5757},
  year   = {2013}
}
R2 v1 2026-06-22T00:22:06.179Z