Parallel Algorithms for Steiner Tree Problem

被引：4
|
作者：
Park, Joon-Sang [1 ]
Ro, Won W. [2 ]
Lee, Handuck [3 ]
Park, Neungsoo [3 ]
机构：
[1] Hongik Univ, Seoul, South Korea
[2] Yeonsei Univ, Seoul, South Korea
[3] Konkuk Univ, Seoul, South Korea
来源：
THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 1, PROCEEDINGS | 2008年
关键词：
D O I：
10.1109/ICCIT.2008.167
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The Steiner tree problem seeks for the shortest tree connecting a given set of terminal points. This paper discusses parallelization of algorithms for the Steiner tree problem. First, a 2-approximation algorithm due to Takahashi and Matsuyama is parallelized for PRAM(Parallel Random Access Machine) model, and then issues in parallelizing another 2-approximation heuristic, namely, Kou, Markowsky, and Berman algorithm and other advance heuristics achieving less approximation ratio are discussed.
引用
收藏
页码：453 / +
页数：2
相关论文
共 50 条
  • [1] A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
    Bezensek, Mitja
    Robic, Borut
    [J]. INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2014, 42 (02) : 287 - 319
  • [2] A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
    Mitja Bezenšek
    Borut Robič
    [J]. International Journal of Parallel Programming, 2014, 42 : 287 - 319
  • [3] Definition and algorithms for reliable steiner tree problem
    Yaohua Tang
    Wenguo Yang
    Tiande Guo
    [J]. Journal of Systems Science and Complexity, 2015, 28 : 876 - 886
  • [4] Exact Algorithms for the Bottleneck Steiner Tree Problem
    Sang Won Bae
    Sunghee Choi
    Chunseok Lee
    Shin-ichi Tanigawa
    [J]. Algorithmica, 2011, 61
  • [5] NEW ALGORITHMS FOR THE RECTILINEAR STEINER TREE PROBLEM
    HO, JM
    VIJAYAN, G
    WONG, CK
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1990, 9 (02) : 185 - 193
  • [6] Algorithms for a Variant of the Full Steiner Tree Problem
    Wang, Haiyan
    Huang, Binchao
    Li, Jianping
    [J]. 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
    [J]. APPLIED AND COMPUTATIONAL MATHEMATICS, 2018, 17 (03) : 246 - 255
  • [8] Definition and Algorithms for Reliable Steiner Tree Problem
    TANG Yaohua
    YANG Wenguo
    GUO Tiande
    [J]. Journal of Systems Science & Complexity, 2015, 28 (04) : 876 - 886
  • [9] On approximation algorithms for the terminal Steiner tree problem
    Drake, DE
    Hougardy, S
    [J]. INFORMATION PROCESSING LETTERS, 2004, 89 (01) : 15 - 18
  • [10] Definition and algorithms for reliable steiner tree problem
    Tang Yaohua
    Yang Wenguo
    Guo Tiande
    [J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2015, 28 (04) : 876 - 886
12345