On the partial terminal Steiner tree problem

Sun-Yuan Hsieh, Huang Ming Gao

研究成果: Article同行評審

14 引文 斯高帕斯(Scopus)

摘要

We investigate a practical variant of the well-known graph Steiner tree problem. For a complete graph G = ( V,E ) with length function l:E → R + and two vertex subsets R ⊂ V and R' ⊆ R, a partial terminal Steiner tree is a Steiner tree which contains all vertices in R such that all vertices in R \ R' belong to the leaves of this Steiner tree. The partial terminal Steiner tree problem is to find a partial terminal Steiner tree T whose total lengths ∑(u,v)∈Tl(u,v) is minimum. In this paper, we show that the problem is both NP-complete and MAX SNP-hard when the lengths of edges are restricted to either 1 or 2. We also provide an approximation algorithm for the problem.

原文English
頁(從 - 到)41-52
頁數12
期刊Journal of Supercomputing
41
發行號1
DOIs
出版狀態Published - 2007 七月 1

All Science Journal Classification (ASJC) codes

  • 理論電腦科學
  • 軟體
  • 資訊系統
  • 硬體和架構

指紋

深入研究「On the partial terminal Steiner tree problem」主題。共同形成了獨特的指紋。

引用此