STEINER PROBLEM IN NETWORKS - A SURVEY

被引：421

作者：

WINTER, P

机构：

来源：

NETWORKS | 1987年 / 17卷 / 02期

关键词：

D O I：

10.1002/net.3230170203

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：129 / 167

页数：39

共 92 条

[71] AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS [J].

SHORE, ML ;

FOULDS, LR ;

GIBBONS, PB .

NETWORKS, 1982, 12 (03) :323-333

[72] STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN [J].

SMITH, JM ;

LIEBMAN, JS .

ENGINEERING OPTIMIZATION, 1979, 4 (01) :15-36

[73] AN 0 (N LOG N) HEURISTIC ALGORITHM FOR THE RECTILINEAR STEINER MINIMAL TREE PROBLEM [J].

SMITH, JM ;

LEE, DT ;

LIEBMAN, JS .

ENGINEERING OPTIMIZATION, 1980, 4 (04) :179-192

[74] AN O(N LOG N) HEURISTIC FOR STEINER MINIMAL TREE PROBLEMS ON THE EUCLIDEAN METRIC [J].

SMITH, JM ;

LEE, DT ;

LIEBMAN, JS .

NETWORKS, 1981, 11 (01) :23-39

[75]

SULLIVAN GF, 1982, 249 YAL U DEP COMP S

[76]

Takahashi H., 1980, MATH JPN, V24, P573

[77] COMPLEXITY OF ENUMERATION AND RELIABILITY PROBLEMS [J].

VALIANT, LG .

SIAM JOURNAL ON COMPUTING, 1979, 8 (03) :410-421

[78] STEINER TREES, PARTIAL 2-TREES, AND MINIMUM IFI NETWORKS [J].

WALD, JA ;

COLBOURN, CJ .

NETWORKS, 1983, 13 (02) :159-167

[79]

WALD JA, 1982, C NUMERANTIUM, V36, P15

[80]

WALD JA, 1982, 827 U SASK DEP COMP

← 1 2 3 4 5 6 7 8 9 10 →