NEAR OPTIMAL-ALGORITHMS FOR FINDING MINIMUM STEINER TREES ON RANDOM GRAPHS

被引：0

作者：

KUCERA, L

MARCHETTISPACCAMELA, A

PROTASI, M

TALAMO, M

机构：

[1] CNR, IASI, ROME, ITALY

[2] UNIV AQUILA, I-67100 Laquila, ITALY

[3] UNIV ROME, I-00100 ROME, ITALY

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 233卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：501 / 511

页数：11

共 50 条

[1] OPTIMAL-ALGORITHMS FOR PERFECTLY BALANCING TREES
ZHENG, SQ
HAQ, E
[J]. COMPUTING AND INFORMATION, 1989, : 125 - 129
[2] 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
[3] OPTIMAL-ALGORITHMS FOR COMPARING TREES WITH LABELED LEAVES
DAY, WHE
[J]. JOURNAL OF CLASSIFICATION, 1985, 2 (01) : 7 - 28
[4] OPTIMAL-ALGORITHMS FOR FINDING THE SYMMETRIES OF A PLANAR POINT SET
HIGHNAM, PT
[J]. INFORMATION PROCESSING LETTERS, 1986, 22 (05) : 219 - 222
[5] SOME OPTIMAL-ALGORITHMS OF RANDOM MULTIPLE ACCESS
KHASMINSKII, RZ
[J]. THEORY OF PROBABILITY AND ITS APPLICATIONS, 1989, 34 (03) : 454 - 463
[6] Simple distributed algorithms for approximating minimum Steiner trees
Chalermsook, P
Fakcharoenphol, J
[J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 380 - 389
[7] Algorithms for finding noncrossing Steiner forests in plane graphs
Kusakari, Y
Masubuchi, D
Nishizeki, T
[J]. ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 337 - 346
[8] EFFICIENT ALGORITHMS FOR FINDING MINIMUM SPANNING-TREES IN UNDIRECTED AND DIRECTED-GRAPHS
GABOW, HN
GALIL, Z
SPENCER, T
TARJAN, RE
[J]. COMBINATORICA, 1986, 6 (02) : 109 - 122
[9] NEAR OPTIMAL BOUNDS FOR STEINER TREES IN THE HYPERCUBE
Jiang, Tao
Miller, Zevi
Pritikin, Dan
[J]. SIAM JOURNAL ON COMPUTING, 2011, 40 (05) : 1340 - 1360
[10] Analysis of Steiner Subtrees of Random Trees for Traceroute Algorithms
Guillemin, Fabrice
Robert, Philippe
[J]. RANDOM STRUCTURES & ALGORITHMS, 2009, 35 (02) : 194 - 215

← 1 2 3 4 5 →