A NEW APPROACH TO THE RECTILINEAR STEINER TREE PROBLEM

被引：0
|
作者：
HO, JM
VIJAYAN, G
WONG, CK
机构：
来源：
26TH ACM/IEEE DESIGN AUTOMATION CONFERENCE | 1989年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：161 / 166
页数：6
相关论文
共 50 条
  • [41] The polygonal contraction heuristic for rectilinear Steiner tree construction
    Wang, Yin
    Hong, Xianlong
    Jing, Tong
    Yang, Yang
    Hu, Xiaodong
    Yan, Guiying
    ASP-DAC 2005: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2005, : 1 - 6
  • [42] A TIGHT WORST CASE BOUND FOR THE PERFORMANCE RATIO OF HEURISTICS FOR THE MINIMUM RECTILINEAR STEINER TREE PROBLEM
    DESOUZA, CC
    RIBEIRO, CC
    OR SPEKTRUM, 1990, 12 (02) : 109 - 111
  • [43] A factoring approach for the Steiner tree problem in undirected networks
    Wang, Chu-Fu
    Jan, Rong-Hong
    INFORMATION SCIENCES, 2007, 177 (12) : 2418 - 2435
  • [44] A new heuristic for rectilinear Steiner trees
    Mandoiu, II
    Vazirani, VV
    Ganley, JL
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2000, 19 (10) : 1129 - 1139
  • [45] RSR: A new Rectilinear Steiner Minimum Tree approximation for FPGA placement and global routing
    de Vicente, J
    Lanchares, J
    Hermida, R
    24TH EUROMICRO CONFERENCE - PROCEEDING, VOLS 1 AND 2, 1998, : 192 - 195
  • [46] New pruning rules for the Steiner tree problem and 2-connected Steiner network problem
    Brazil, Marcus
    Volz, Marcus
    Zachariasen, Martin
    Ras, Charl
    Thomas, Doreen
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 78 : 37 - 49
  • [47] A new heuristic for the Euclidean Steiner Tree Problem in Rn
    Pinto, Renan Vicente
    Maculan, Nelson
    TOP, 2023, 31 (02) : 391 - 413
  • [48] New Advances in Reoptimizing the Minimum Steiner Tree Problem
    Bilo, Davide
    Zych, Anna
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 184 - 197
  • [49] New reduction techniques for the group Steiner tree problem
    Ferreira, Carlos Eduardo
    De Oliveira, Fernando M.
    SIAM JOURNAL ON OPTIMIZATION, 2006, 17 (04) : 1176 - 1188
  • [50] The rectilinear Steiner arborescence problem is NP-complete
    Shi, WP
    Su, C
    SIAM JOURNAL ON COMPUTING, 2006, 35 (03) : 729 - 740
12345