FASTER EXACT ALGORITHMS FOR STEINER TREES IN PLANAR NETWORKS

被引：26
|
作者：
BERN, M
机构：
[1] Xerox Palo Alto Research Center, Palo Alto, California
来源：
NETWORKS | 1990年 / 20卷 / 01期
关键词：
D O I：
10.1002/net.3230200110
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
引用
收藏
页码：109 / 120
页数：12
相关论文
共 50 条
  • [1] Faster algorithm for optimum Steiner trees
    Vygen, Jens
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (21-22) : 1075 - 1079
  • [2] ON STEINER TREES AND GENETIC ALGORITHMS
    HESSER, J
    MANNER, R
    STUCKY, O
    [J]. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 565 : 509 - 525
  • [3] Algorithms for terminal Steiner trees
    Martinez, FV
    de Pina, JC
    Soares, J
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 369 - 379
  • [4] Algorithms for terminal Steiner trees
    Martinez, Fabio Viduani
    de Pina, Jose Coelho
    Soares, Jose
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 133 - 142
  • [5] HEURISTIC ALGORITHMS FOR RECTILINEAR STEINER TREES
    SERVIT, M
    [J]. DIGITAL PROCESSES, 1981, 7 (01): : 21 - 32
  • [6] Packing Steiner trees: Separation algorithms
    Grotschel, M
    Martin, A
    Weismantel, R
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1996, 9 (02) : 233 - 257
  • [7] STEINER TREES IN PROBABILISTIC NETWORKS
    WALD, JA
    COLBOURN, CJ
    [J]. MICROELECTRONICS RELIABILITY, 1983, 23 (05) : 837 - 840
  • [8] Approximation of Steiner Minimum Trees in Euclidean Planar Graphs Using Euclidian Steiner Minimum Trees
    Zenker, Bjoern
    [J]. 20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 931 - 932
  • [9] Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
    A. Aazami
    J. Cheriyan
    K. R. Jampani
    [J]. Algorithmica, 2012, 63 : 425 - 456
  • [10] Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
    Aazami, Ashkan
    Cheriyan, Joseph
    Jampani, Krishnam Raju
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2009, 5687 : 1 - +
12345