On greedy heuristics for steiner minimum trees

被引：0
|
作者：
机构：
来源：
Algorithmica (New York) | / 4卷 / 381期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Non-Greedy Online Steiner Trees on Outerplanar Graphs
    Matsubayashi, Akira
    ALGORITHMICA, 2021, 83 (02) : 613 - 640
  • [22] Computing Steiner Minimum Trees in Hamming Metric
    Althaus, Ernst
    Naujoks, Rouven
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 172 - +
  • [23] Grade of service euclidean Steiner minimum trees
    Xue, GL
    Lin, GH
    Du, DZ
    ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS, 1999, : 182 - 185
  • [24] Greedy Heuristics for Minimization of Number of Terminal Nodes in Decision Trees
    Hussain, Shahid
    2014 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING (GRC), 2014, : 112 - 115
  • [25] STEINER TREES, PARTIAL 2-TREES, AND MINIMUM IFI NETWORKS
    WALD, JA
    COLBOURN, CJ
    NETWORKS, 1983, 13 (02) : 159 - 167
  • [26] Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications
    Hibi, Tomoya
    Fujito, Toshihiro
    ALGORITHMICA, 2016, 74 (02) : 778 - 786
  • [27] Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications
    Tomoya Hibi
    Toshihiro Fujito
    Algorithmica, 2016, 74 : 778 - 786
  • [28] Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications
    Hibi, Tomoya
    Fujito, Toshihiro
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2012, 7551 : 215 - 224
  • [29] Minimum Steiner trees on a set of concyclic points and their center
    Whittle, David
    Brazil, Marcus
    Grossman, Peter Alexander
    Rubinstein, Joachim Hyam
    Thomas, Doreen A.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (04) : 2201 - 2225
  • [30] Grade of Service Steiner Minimum Trees in the Euclidean plane
    Xue, G
    Lin, GH
    Du, DZ
    ALGORITHMICA, 2001, 31 (04) : 479 - 500
12345