STEINER PROBLEM IN GRAPHS - HEURISTIC METHODS

被引：67
|
作者：
VOSS, S
机构：
[1] FB 1/FG Operations Research, Technische Hochschule Darmstadt, D-6100 Darmstadt
来源：
DISCRETE APPLIED MATHEMATICS | 1992年 / 40卷 / 01期
关键词：
D O I：
10.1016/0166-218X(92)90021-2
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Real world problems arising in the layout of connection structures in networks as e.g. in VLSI design may often be decomposed into a number of well-known combinatorial optimization problems. Steiner's problem in graphs is included within this context. According to its complexity one is interested in developing efficient heuristic algorithms to find good approximate solutions. Here a comparison of various heuristic methods for Steiner's problem in graphs is presented.
引用
收藏
页码：45 / 72
页数：28
相关论文
共 50 条
  • [1] Parallel Minimum Spanning Tree Heuristic for the Steiner problem in graphs
    Akbari, Hoda
    Iramnanesh, Zeinab
    Ghodsi, Mohammad
    2007 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOLS 1 AND 2, 2007, : 443 - 450
  • [2] A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs
    Zhang, Hao
    Ye, Dong-Yi
    Guo, Wen-Zhong
    JOURNAL OF ALGORITHMS & COMPUTATIONAL TECHNOLOGY, 2016, 10 (02) : 99 - 114
  • [3] The Steiner Problem in Graphs: Topological Methods of Solution
    A. V. Panyukov
    Automation and Remote Control, 2004, 65 : 439 - 448
  • [4] The Steiner problem in graphs: Topological methods of solution
    Panyukov, AV
    AUTOMATION AND REMOTE CONTROL, 2004, 65 (03) : 439 - 448
  • [5] The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
    Duin, G
    Voss, S
    NETWORKS, 1999, 34 (03) : 181 - 191
  • [6] A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs
    Leitner, Markus
    Ljubic, Ivana
    Luipersbeck, Martin
    Resch, Max
    HYBRID METAHEURISTICS, HM 2014, 2014, 8457 : 56 - 70
  • [7] A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
    Bosman, Thomas
    EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 391 - 402
  • [8] A heuristic method for solving the Steiner tree problem in graphs using network centralities
    Fujita, Misa
    Shimada, Yutaka
    Kimura, Takayuki
    Ikeguchi, Tohru
    PLOS ONE, 2024, 19 (06):
  • [9] HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS
    PLESNIK, J
    DISCRETE APPLIED MATHEMATICS, 1992, 37-8 : 451 - 463
  • [10] AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS
    BEASLEY, JE
    NETWORKS, 1984, 14 (01) : 147 - 159
12345