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 条
  • [41] On a Relative MaxSAT Encoding for the Steiner Tree Problem in Graphs
    de Oliveira, Ricardo Tavares
    Silva, Fabiano
    ADVANCES IN ARTIFICIAL INTELLIGENCE AND ITS APPLICATIONS, MICAI 2015, PT II, 2015, 9414 : 422 - 434
  • [42] Solving the Steiner tree problem in graphs by chaotic search
    Fujita, Misa
    Kimura, Takayuki
    Ikeguchi, Tohru
    IEICE NONLINEAR THEORY AND ITS APPLICATIONS, 2020, 11 (01): : 90 - 108
  • [43] The Steiner cycle and path cover problem on interval graphs
    Ante Ćustić
    Stefan Lendl
    Journal of Combinatorial Optimization, 2022, 43 : 226 - 234
  • [44] A high performance approximate algorithm for the Steiner problem in graphs
    Guitart, P
    Basart, JM
    RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE, 1998, 1518 : 280 - 293
  • [45] An exact branch and bound algorithm for the Steiner problem in graphs
    Khoury, BN
    Pardalos, PM
    COMPUTING AND COMBINATORICS, 1995, 959 : 582 - 590
  • [46] The Steiner cycle and path cover problem on interval graphs
    Custic, Ante
    Lendl, Stefan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (01) : 226 - 234
  • [47] A FASTER APPROXIMATION ALGORITHM FOR THE STEINER TREE PROBLEM IN GRAPHS
    ZELIKOVSKY, AZ
    INFORMATION PROCESSING LETTERS, 1993, 46 (02) : 79 - 83
  • [48] A NOTE ON A FASTER APPROXIMATION ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS
    FLOREN, R
    INFORMATION PROCESSING LETTERS, 1991, 38 (04) : 177 - 178
  • [49] A HEURISTIC FOR THE P-CENTER PROBLEM IN GRAPHS
    PLESNIK, J
    DISCRETE APPLIED MATHEMATICS, 1987, 17 (03) : 263 - 268
  • [50] A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in ℜd
    Jon W. Van Laarhoven
    Jeffrey W. Ohlmann
    Journal of Heuristics, 2011, 17 : 353 - 372
12345