Definition and algorithms for reliable steiner tree problem

被引：1
|
作者：
Tang Yaohua [1 ]
Yang Wenguo [1 ]
Guo Tiande [1 ]
机构：
[1] Univ Chinese Acad Sci, Sch Math, Beijing 100049, Peoples R China
来源：
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY | 2015年 / 28卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Approximation algorithm; exact algorithm; reliability; steiner tree; APPROXIMATION;
D O I：
10.1007/s11424-014-2120-2
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：876 / 886
页数：11
相关论文
共 50 条
  • [1] Definition and algorithms for reliable steiner tree problem
    Yaohua Tang
    Wenguo Yang
    Tiande Guo
    Journal of Systems Science and Complexity, 2015, 28 : 876 - 886
  • [2] Definition and Algorithms for Reliable Steiner Tree Problem
    TANG Yaohua
    YANG Wenguo
    GUO Tiande
    JournalofSystemsScience&Complexity, 2015, 28 (04) : 876 - 886
  • [3] Parallel Algorithms for Steiner Tree Problem
    Park, Joon-Sang
    Ro, Won W.
    Lee, Handuck
    Park, Neungsoo
    THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 1, PROCEEDINGS, 2008, : 453 - +
  • [4] NEW ALGORITHMS FOR THE RECTILINEAR STEINER TREE PROBLEM
    HO, JM
    VIJAYAN, G
    WONG, CK
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1990, 9 (02) : 185 - 193
  • [5] Exact Algorithms for the Bottleneck Steiner Tree Problem
    Sang Won Bae
    Sunghee Choi
    Chunseok Lee
    Shin-ichi Tanigawa
    Algorithmica, 2011, 61
  • [6] Algorithms for a Variant of the Full Steiner Tree Problem
    Wang, Haiyan
    Huang, Binchao
    Li, Jianping
    2021 IEEE/ACIS 20TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS 2021-SUMMER), 2021, : 16 - 21
  • [7] APPROXIMATION ALGORITHMS FOR THE TERMINAL STEINER TREE PROBLEM
    Chen, Yen Hung
    Lin, Ying Chin
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2018, 17 (03) : 246 - 255
  • [8] On approximation algorithms for the terminal Steiner tree problem
    Drake, DE
    Hougardy, S
    INFORMATION PROCESSING LETTERS, 2004, 89 (01) : 15 - 18
  • [9] Exact Algorithms for the Bottleneck Steiner Tree Problem
    Bae, Sang Won
    Choi, Sunghee
    Lee, Chunseok
    Tanigawa, Shin-ichi
    ALGORITHMICA, 2011, 61 (04) : 924 - 948
  • [10] Faster approximation algorithms for the rectilinear Steiner tree problem
    Fossmeier, U
    Kaufmann, M
    Zelikovsky, A
    DISCRETE & COMPUTATIONAL GEOMETRY, 1997, 18 (01) : 93 - 109
12345