AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS

被引：31

|

作者：

SHORE, ML

FOULDS, LR

GIBBONS, PB

机构：

来源：

NETWORKS | 1982年 / 12卷 / 03期

关键词：

D O I：

10.1002/net.3230120309

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：323 / 333

页数：11

相关论文

共 50 条

[1] AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS
BEASLEY, JE
NETWORKS, 1984, 14 (01) : 147 - 159
[2] A robust and scalable algorithm for the Steiner problem in graphs
Pajor, Thomas
Uchoa, Eduardo
Werneck, Renato F.
MATHEMATICAL PROGRAMMING COMPUTATION, 2018, 10 (01) : 69 - 118
[3] A 1.598 approximation algorithm for the Steiner problem in graphs
Hougardy, S
Prömel, HJ
PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 448 - 453
[4] A branch and cut algorithm for the Steiner problem in graphs
Lucena, A
Beasley, JE
NETWORKS, 1998, 31 (01) : 39 - 59
[5] A FASTER APPROXIMATION ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS
WU, YF
WIDMAYER, P
WONG, CK
ACTA INFORMATICA, 1986, 23 (02) : 223 - 229
[6] A FASTER APPROXIMATION ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS
MEHLHORN, K
INFORMATION PROCESSING LETTERS, 1988, 27 (03) : 125 - 128
[7] An ant algorithm for the Steiner Tree Problem in graphs
Luyet, Luc
Varone, Sacha
Zufferey, Nicolas
APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2007, 4448 : 42 - +
[8] AN SST-BASED ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS
BEASLEY, JE
NETWORKS, 1989, 19 (01) : 1 - 16
[9] An exact branch and bound algorithm for the Steiner problem in graphs
Khoury, BN
Pardalos, PM
COMPUTING AND COMBINATORICS, 1995, 959 : 582 - 590
[10] A high performance approximate algorithm for the Steiner problem in graphs
Guitart, P
Basart, JM
RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE, 1998, 1518 : 280 - 293

← 1 2 3 4 5 →