On the terminal Steiner tree problem

  • Authors:
  • Guohui Lin;Guoliang Xue

  • Affiliations:
  • Department of Computing Science, University of Alberta, Edmonton, AB. T6G 2E8, Canada;Department of Computer Science and Engineering, Arizona State University, Tempe, AZ

  • Venue:
  • Information Processing Letters
  • Year:
  • 2002

Quantified Score

Hi-index 0.90

Visualization

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.