On the terminal Steiner tree problem

Guohui Lin, Guoliang Xue

Research output: Contribution to journal › Article

45 Citations (Scopus)

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

Fingerprint

Steiner Tree Problem
Approximation algorithms
Hardness
Polynomials
Steiner Tree
Graph in graph theory
Vertex of a graph
Best Approximation
Polynomial-time Algorithm
Approximation Algorithms
Leaves
Target

Keywords

  • Approximation algorithms
  • Steiner minimum tree
  • Terminal Steiner tree

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On the terminal Steiner tree problem. / Lin, Guohui; Xue, Guoliang.

In: Information Processing Letters, Vol. 84, No. 2, 31.10.2002, p. 103-107.

Research output: Contribution to journal › Article

Lin, G & Xue, G 2002, 'On the terminal Steiner tree problem', Information Processing Letters, vol. 84, no. 2, pp. 103-107. https://doi.org/10.1016/S0020-0190(02)00227-2
Lin G, Xue G. On the terminal Steiner tree problem. Information Processing Letters. 2002 Oct 31;84(2):103-107. https://doi.org/10.1016/S0020-0190(02)00227-2
Lin, Guohui ; Xue, Guoliang. / On the terminal Steiner tree problem. In: Information Processing Letters. 2002 ; Vol. 84, No. 2. pp. 103-107.
@article{af4d445203e94e37b79420fbe9db5aef,
title = "On the terminal Steiner tree problem",
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.",
keywords = "Approximation algorithms, Steiner minimum tree, Terminal Steiner tree",
author = "Guohui Lin and Guoliang Xue",
year = "2002",
month = "10",
day = "31",
doi = "10.1016/S0020-0190(02)00227-2",
language = "English (US)",
volume = "84",
pages = "103--107",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - On the terminal Steiner tree problem

AU - Lin, Guohui

AU - Xue, Guoliang

PY - 2002/10/31

Y1 - 2002/10/31

N2 - 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.

AB - 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.

KW - Approximation algorithms

KW - Steiner minimum tree

KW - Terminal Steiner tree

UR - http://www.scopus.com/inward/record.url?scp=0037206566&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037206566&partnerID=8YFLogxK

U2 - 10.1016/S0020-0190(02)00227-2

DO - 10.1016/S0020-0190(02)00227-2

M3 - Article

AN - SCOPUS:0037206566

VL - 84

SP - 103

EP - 107

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 2

ER -

Access to Document