An improved approximation ratio to the partial-terminal steiner tree problem

Chia Wei Lee, Chao Wen Huang, Wen Hao Pi, Sun-Yuan Hsieh

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

We consider a generalization of both the classic Steiner tree problem and the terminal Steiner tree problem. Given a complete graph G = (V,E) with a metric cost function c:E BBQ≥ and two proper subsets R V and R′ R , a partial-terminal Steiner tree is a Steiner tree which contains all vertices in it R such that all vertices in R ′ must be leaves. The partial-terminal Steiner tree problem is to find a partial-terminal Steiner tree of the minimum cost in G. The previously best-known approximation ratio of the problem is 2ρ , where ρ is the approximation ratio of the Steiner tree problem. In this paper, we improve the ratio from 2ρ to 2ρ-ρ3ρ-2-f , where f is a non-negative function whose value is between 0 and ρ-ρ over 3ρ-2.

Original languageEnglish
Article number6636895
Pages (from-to)274-279
Number of pages6
JournalIEEE Transactions on Computers
Volume64
Issue number1
DOIs
Publication statusPublished - 2015 Jan 1

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'An improved approximation ratio to the partial-terminal steiner tree problem'. Together they form a unique fingerprint.

Cite this