CSpace
ON COMPONENT-SIZE BOUNDED STEINER TREES
DU, DZ
1995-06-23
Source PublicationDISCRETE APPLIED MATHEMATICS
ISSN0166-218X
Volume60Issue:1-3Pages:131-140
AbstractA Steiner tree is a tree interconnecting a given set of points in a metric space such that all leaves are given points. A (full) component of a Steiner tree is a subtree which results from splitting the Steiner tree at some given points. A k-size Steiner tree is a Steiner tree in which every component has at most k given points. The k-Steiner ratio is the largest lower bound for the ratio between lengths of a minimum Steiner tree and a minimum k-size Steiner tree for the same set of points. In this paper, we determine the 3-Steiner ratio in weighted graphs.
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics, Applied
WOS IDWOS:A1995RF65100010
PublisherELSEVIER SCIENCE BV
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/28169
Collection中国科学院数学与系统科学研究院
Corresponding AuthorDU, DZ
AffiliationCHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
Recommended Citation
GB/T 7714
DU, DZ. ON COMPONENT-SIZE BOUNDED STEINER TREES[J]. DISCRETE APPLIED MATHEMATICS,1995,60(1-3):131-140.
APA DU, DZ.(1995).ON COMPONENT-SIZE BOUNDED STEINER TREES.DISCRETE APPLIED MATHEMATICS,60(1-3),131-140.
MLA DU, DZ."ON COMPONENT-SIZE BOUNDED STEINER TREES".DISCRETE APPLIED MATHEMATICS 60.1-3(1995):131-140.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[DU, DZ]'s Articles
Baidu academic
Similar articles in Baidu academic
[DU, DZ]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[DU, DZ]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.