STEINER PROBLEM IN NETWORKS - A SURVEY

被引：421

作者：

WINTER, P

机构：

来源：

关键词：

D O I：

10.1002/net.3230170203

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：129 / 167

页数：39

共 92 条

[1] RECTILINEAR STEINER TREES - EFFICIENT SPECIAL-CASE ALGORITHMS [J].

AHO, AV ;

GAREY, MR ;

HWANG, FK .

ANEJA, YP .

[3]

Arnborg S, 1984, TRITANA8404 ROYAL I

[4]

ARNBORG S, 1984, TRITANA8402 ROYAL I

[5]

BALAKRISHNAN A, 1985, UNPUB PROBLEM REDUCT

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

BEASLEY, JE .

[7]

BEASLEY JE, 1985, SST BASED ALGORITHM

[8]

Bellman R., 1958, Q APPL MATH, V16, P87

[9] SET COVERING AND INVOLUTORY BASES [J].

BELLMORE, M ;

RATLIFF, HD .

MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 18 (03) :194-206

[10]

Boyce W. M., 1977, ACM Transactions on Mathematical Software, V3, P359, DOI 10.1145/355759.355764