Diameter-constrained steiner tree

Wei Ding; Guohui Lin; Guoliang Xue

doi:10.1007/978-3-642-17461-2_20

Diameter-constrained steiner tree

Wei Ding, Guohui Lin, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

Abstract

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 ₀, we seek a minimum cost Steiner tree where all terminals appear as leaves and its diameter is bounded by D ₀. 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.

Original language	English (US)
Title of host publication	Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings
Pages	243-253
Number of pages	11
Edition	PART 2
DOIs	https://doi.org/10.1007/978-3-642-17461-2_20
State	Published - 2010
Event	4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 - Kailua-Kona, HI, United States Duration: Dec 18 2010 → Dec 20 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	6509 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010
Country/Territory	United States
City	Kailua-Kona, HI
Period	12/18/10 → 12/20/10

Keywords

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

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Ding, W., Lin, G., & Xue, G. (2010). Diameter-constrained steiner tree. In Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings (PART 2 ed., pp. 243-253). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6509 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-17461-2_20

Diameter-constrained steiner tree. / Ding, Wei; Lin, Guohui; Xue, Guoliang.
Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings. PART 2. ed. 2010. p. 243-253 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6509 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ding, W, Lin, G & Xue, G 2010, Diameter-constrained steiner tree. in Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 6509 LNCS, pp. 243-253, 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010, Kailua-Kona, HI, United States, 12/18/10. https://doi.org/10.1007/978-3-642-17461-2_20

@inproceedings{86bc2abf1e9048f897d2920bd0b8965b,

title = "Diameter-constrained steiner tree",

abstract = "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.",

keywords = "Diameter-constrained Steiner tree, fixed topology, fully polynomial time approximation scheme",

author = "Wei Ding and Guohui Lin and Guoliang Xue",

year = "2010",

doi = "10.1007/978-3-642-17461-2_20",

language = "English (US)",

isbn = "3642174604",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 2",

pages = "243--253",

booktitle = "Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings",

edition = "PART 2",

note = "4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 ; Conference date: 18-12-2010 Through 20-12-2010",

}

TY - GEN

T1 - Diameter-constrained steiner tree

AU - Ding, Wei

AU - Lin, Guohui

AU - Xue, Guoliang

PY - 2010

Y1 - 2010

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 -

Diameter-constrained steiner tree

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this