SOME GENERALIZATIONS OF THE STEINER PROBLEM IN GRAPHS

被引：32

作者：

DUIN, CW

VOLGENANT, A

机构：

来源：

关键词：

D O I：

10.1002/net.3230170309

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：353 / 364

页数：12

共 11 条

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

BEASLEY, JE .

[2]

BEASLEY JE, 1987, SST BASED ALGORITHM

[3]

Dijkstra E. W., 1959, NUMER MATH, P269, DOI DOI 10.1007/BF01386390

[4]

DUIN CW, 1986, REDUCTION TESTS STEI

[5]

Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]

IWAINSKY, A ;

CANUTO, E ;

TARASZOW, O ;

VILLA, A .

[7]

Karp R. M., 1972, COMPLEXITY COMPUTER

[8] SHORTEST CONNECTION NETWORKS AND SOME GENERALIZATIONS [J].

PRIM, RC .

BELL SYSTEM TECHNICAL JOURNAL, 1957, 36 (06) :1389-1401

[9] THE NODE-WEIGHTED STEINER TREE PROBLEM [J].

SEGEV, A .

[10]

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