TY - GEN

T1 - Diameter-constrained steiner tree

AU - Ding, Wei

AU - Lin, Guohui

AU - Xue, Guoliang

PY - 2010/12/1

Y1 - 2010/12/1

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

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

KW - Diameter-constrained Steiner tree

KW - fixed topology

KW - fully polynomial time approximation scheme

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

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

U2 - 10.1007/978-3-642-17461-2_20

DO - 10.1007/978-3-642-17461-2_20

M3 - Conference contribution

AN - SCOPUS:78650828108

SN - 3642174604

SN - 9783642174605

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 243

EP - 253

BT - Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings

T2 - 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010

Y2 - 18 December 2010 through 20 December 2010

ER -