On the terminal Steiner tree problem

Guohui Lin, Guoliang Xue

Research output: Contribution to journalArticlepeer-review

54 Scopus citations


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 languageEnglish (US)
Pages (from-to)103-107
Number of pages5
JournalInformation Processing Letters
Issue number2
StatePublished - Oct 31 2002


  • Approximation algorithms
  • Steiner minimum tree
  • Terminal Steiner tree

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'On the terminal Steiner tree problem'. Together they form a unique fingerprint.

Cite this