Abstract
We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio ρ+2, where ρ is the best-known approximation ratio for the graph Steiner tree problem.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 103-107 |
| Number of pages | 5 |
| Journal | Information Processing Letters |
| Volume | 84 |
| Issue number | 2 |
| DOIs | |
| State | Published - Oct 31 2002 |
Keywords
- Approximation algorithms
- Steiner minimum tree
- Terminal Steiner tree
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications
Fingerprint Dive into the research topics of 'On the terminal Steiner tree problem'. Together they form a unique fingerprint.
Cite this
Lin, G., & Xue, G. (2002). On the terminal Steiner tree problem. Information Processing Letters, 84(2), 103-107. https://doi.org/10.1016/S0020-0190(02)00227-2