Definition and algorithms for reliable steiner tree problem
文献类型：期刊论文
| 作者 | Tang Yaohua; Yang Wenguo; Guo Tiande |
| 刊名 | Journal of systems science & complexity
 |
| 出版日期 | 2015-08-01 |
| 卷号 | 28期号:4页码:876-886 |
| 关键词 | Approximation algorithm Exact algorithm Reliability Steiner tree |
| ISSN号 | 1009-6124 |
| DOI | 10.1007/s11424-014-2120-2 |
| 通讯作者 | Tang yaohua(tangyaohua28@gmail.com) |
| 英文摘要 | This paper considers a new form of the steiner tree problem that is more practical and reliable, which we call reliable steiner tree (rst) problem. the authors give a detailed definition for this new problem and design both an exact algorithm and an approximation algorithm for it. the definition is based on the reliability of full components instead of steiner vertices. the task is thus to find the most reliable full components to make up an optimum reliable steiner tree. the exact algorithm designed for this problem utilizes a dynamic programming frame. the approximationalgorithm designed in this paper exploits a local search strategy that looks for the best full component according to a selection function at a time. |
| WOS关键词 | APPROXIMATION |
| WOS研究方向 | Mathematics |
| WOS类目 | Mathematics, Interdisciplinary Applications |
| 语种 | 英语 |
| WOS记录号 | WOS:000356820600009 |
| 出版者 | SPRINGER HEIDELBERG |
| URI标识 | http://www.irgrid.ac.cn/handle/1471x/2376371 |
| 专题 | 中国科学院大学 |
| 通讯作者 | Tang Yaohua |
| 作者单位 | Univ Chinese Acad Sci, Sch Math, Beijing 100049, Peoples R China |
| 推荐引用方式 GB/T 7714 | Tang Yaohua,Yang Wenguo,Guo Tiande. Definition and algorithms for reliable steiner tree problem[J]. Journal of systems science & complexity,2015,28(4):876-886. |
| APA | Tang Yaohua,Yang Wenguo,&Guo Tiande.(2015).Definition and algorithms for reliable steiner tree problem.Journal of systems science & complexity,28(4),876-886. |
| MLA | Tang Yaohua,et al."Definition and algorithms for reliable steiner tree problem".Journal of systems science & complexity 28.4(2015):876-886. |
入库方式： iSwitch采集
来源：中国科学院大学
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。