Diameter-constrained steiner tree

Wei Ding, Guohui Lin, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

Original languageEnglish (US)
Title of host publicationCombinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings
Pages243-253
Number of pages11
EditionPART 2
DOIs
StatePublished - Dec 1 2010
Event4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 - Kailua-Kona, HI, United States
Duration: Dec 18 2010Dec 20 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6509 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010
CountryUnited States
CityKailua-Kona, HI
Period12/18/1012/20/10

    Fingerprint

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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