On greedy heuristics for steiner minimum trees

被引：0
|
作者：
机构：
来源：
Algorithmica (New York) | / 4卷 / 381期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] ON GREEDY HEURISTICS FOR STEINER MINIMUM TREES
    DU, DZ
    ALGORITHMICA, 1995, 13 (04) : 381 - 386
  • [2] ON BETTER HEURISTICS FOR STEINER MINIMUM TREES
    DU, DZ
    ZHANG, YJ
    MATHEMATICAL PROGRAMMING, 1992, 57 (02) : 193 - 202
  • [3] Approximation of Steiner Minimum Trees in Euclidean Planar Graphs Using Euclidian Steiner Minimum Trees
    Zenker, Bjoern
    20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 931 - 932
  • [4] On Steiner trees and minimum spanning trees in hypergraphs
    Polzin, T
    Daneshmand, SV
    OPERATIONS RESEARCH LETTERS, 2003, 31 (01) : 12 - 20
  • [5] Approximations for Steiner Trees with Minimum Number of Steiner Points
    DONGHUI CHEN
    DING-ZHU DU
    XIAO-DONG HU
    GUO-HUI LIN
    LUSHENG WANG
    GUOLIANG XUE
    Journal of Global Optimization, 2000, 18 : 17 - 33
  • [6] Approximations for Steiner trees with minimum number of Steiner points
    Chen, DH
    Du, DZ
    Hu, XD
    Lin, GH
    Wang, LS
    Xue, GL
    THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 83 - 99
  • [7] Approximations for Steiner trees with minimum number of Steiner points
    Chen, DG
    Du, DZ
    Hu, XD
    Lin, GH
    Wang, LS
    Xue, GL
    JOURNAL OF GLOBAL OPTIMIZATION, 2000, 18 (01) : 17 - 33
  • [8] MINIMUM STEINER TREES IN NORMED PLANES
    DU, DZ
    GAO, B
    GRAHAM, RL
    LIU, ZC
    WAN, PJ
    DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (04) : 351 - 370
  • [9] Dynamic programming for minimum steiner trees
    Fuchs, B.
    Kern, W.
    Moelle, D.
    Richter, S.
    Rossmanith, Peter
    Wang, X.
    THEORY OF COMPUTING SYSTEMS, 2007, 41 (03) : 493 - 500
  • [10] MINIMUM DIAMETER STEINER TREES IN A GRAPH
    KUNDU, S
    OPERATIONS RESEARCH, 1975, 23 : B357 - B357
12345