Diameter-constrained steiner trees

W. E.I. Ding, Guohui Lin, Guoliang Xue

Research output: Contribution to journalArticle

Abstract

Given an edge-weighted undirected graph G = (V, E, c, w), where each edge e E has a non-negative cost c(e) and a non-negative weight w(e), a set S V of terminals and a positive constant D0, we seek a minimum cost Steiner tree in which all terminals appear as leaves and the tree diameter is bounded by D0. Here the tree diameter is the maximum weight of the paths connecting two different leaves in the tree. Such a problem is called the minimum cost diameter-constrained Steiner tree problem. The problem is NP-hard even when the topology of the Steiner tree is fixed. In present paper we focus on this fixed topology restricted version and present a fully polynomial time approximation scheme for computing a minimum cost diameter-constrained Steiner tree.

Original languageEnglish (US)
Pages (from-to)491-502
Number of pages12
JournalDiscrete Mathematics, Algorithms and Applications
Volume3
Issue number4
DOIs
StatePublished - Dec 1 2011

Fingerprint

Steiner Tree
Costs
Leaves
Non-negative
Topology
Fully Polynomial Time Approximation Scheme
Steiner Tree Problem
Weighted Graph
Undirected Graph
NP-complete problem
Path
Computing

Keywords

  • Diameter-constrained Steiner tree
  • fixed topology
  • fully polynomial time approximation scheme

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Diameter-constrained steiner trees. / Ding, W. E.I.; Lin, Guohui; Xue, Guoliang.

In: Discrete Mathematics, Algorithms and Applications, Vol. 3, No. 4, 01.12.2011, p. 491-502.

Research output: Contribution to journalArticle

Ding, W. E.I. ; Lin, Guohui ; Xue, Guoliang. / Diameter-constrained steiner trees. In: Discrete Mathematics, Algorithms and Applications. 2011 ; Vol. 3, No. 4. pp. 491-502.
@article{fb2f3d9612034d78928021f2c0bbe6d1,
title = "Diameter-constrained steiner trees",
abstract = "Given an edge-weighted undirected graph G = (V, E, c, w), where each edge e E has a non-negative cost c(e) and a non-negative weight w(e), a set S V of terminals and a positive constant D0, we seek a minimum cost Steiner tree in which all terminals appear as leaves and the tree diameter is bounded by D0. Here the tree diameter is the maximum weight of the paths connecting two different leaves in the tree. Such a problem is called the minimum cost diameter-constrained Steiner tree problem. The problem is NP-hard even when the topology of the Steiner tree is fixed. In present paper we focus on this fixed topology restricted version and present a fully polynomial time approximation scheme for computing a minimum cost diameter-constrained Steiner tree.",
keywords = "Diameter-constrained Steiner tree, fixed topology, fully polynomial time approximation scheme",
author = "Ding, {W. E.I.} and Guohui Lin and Guoliang Xue",
year = "2011",
month = "12",
day = "1",
doi = "10.1142/S179383091100136X",
language = "English (US)",
volume = "3",
pages = "491--502",
journal = "Discrete Mathematics, Algorithms and Applications",
issn = "1793-8309",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - Diameter-constrained steiner trees

AU - Ding, W. E.I.

AU - Lin, Guohui

AU - Xue, Guoliang

PY - 2011/12/1

Y1 - 2011/12/1

N2 - Given an edge-weighted undirected graph G = (V, E, c, w), where each edge e E has a non-negative cost c(e) and a non-negative weight w(e), a set S V of terminals and a positive constant D0, we seek a minimum cost Steiner tree in which all terminals appear as leaves and the tree diameter is bounded by D0. Here the tree diameter is the maximum weight of the paths connecting two different leaves in the tree. Such a problem is called the minimum cost diameter-constrained Steiner tree problem. The problem is NP-hard even when the topology of the Steiner tree is fixed. In present paper we focus on this fixed topology restricted version and present a fully polynomial time approximation scheme for computing a minimum cost diameter-constrained Steiner tree.

AB - Given an edge-weighted undirected graph G = (V, E, c, w), where each edge e E has a non-negative cost c(e) and a non-negative weight w(e), a set S V of terminals and a positive constant D0, we seek a minimum cost Steiner tree in which all terminals appear as leaves and the tree diameter is bounded by D0. Here the tree diameter is the maximum weight of the paths connecting two different leaves in the tree. Such a problem is called the minimum cost diameter-constrained Steiner tree problem. The problem is NP-hard even when the topology of the Steiner tree is fixed. In present paper we focus on this fixed topology restricted version and present a fully polynomial time approximation scheme for computing a minimum cost diameter-constrained Steiner tree.

KW - Diameter-constrained Steiner tree

KW - fixed topology

KW - fully polynomial time approximation scheme

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

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

U2 - 10.1142/S179383091100136X

DO - 10.1142/S179383091100136X

M3 - Article

VL - 3

SP - 491

EP - 502

JO - Discrete Mathematics, Algorithms and Applications

JF - Discrete Mathematics, Algorithms and Applications

SN - 1793-8309

IS - 4

ER -