WORST-CASE PERFORMANCE OF SOME HEURISTICS FOR STEINER PROBLEM IN DIRECTED-GRAPHS

被引：8

作者：

VOSS, S

机构：

[1] FB 1 / FG Operations Research, Technische Hochschule Darmstadt, D-64289 Darmstadt

来源：

INFORMATION PROCESSING LETTERS | 1993年 / 48卷 / 02期

关键词：

GRAPHS; STEINER PROBLEM; HEURISTICS; WORST CASE;

D O I：

10.1016/0020-0190(93)90185-C

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Steiner's problem in directed graphs is to find a minimum-cost subgraph of a given directed graph such that a directed path from a root node to every vertex of a set of specified vertices exists. According to the NP-hardness of the problem one is interested in developing efficient heuristic algorithms to find good approximate solutions. In this paper we investigate the worst-case performance of some heuristics and study their comparability by means of some examples.

引用

页码：99 / 105

页数：7

共 50 条

[1] A LOWER BOUND FOR THE STEINER TREE PROBLEM IN DIRECTED-GRAPHS
LIU, WG
[J]. NETWORKS, 1990, 20 (06) : 765 - 778
[2] WORST-CASE ANALYSIS OF NETWORK DESIGN PROBLEM HEURISTICS
WONG, RT
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (01): : 51 - 63
[3] ON THE WORST-CASE PERFORMANCE OF SOME HEURISTICS FOR THE VEHICLE-ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOW CONSTRAINTS
SOLOMON, MM
[J]. NETWORKS, 1986, 16 (02) : 161 - 174
[4] HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS
PLESNIK, J
[J]. DISCRETE APPLIED MATHEMATICS, 1992, 37-8 : 451 - 463
[5] ON THE ADDRESSING PROBLEM FOR DIRECTED-GRAPHS
CHUNG, FRK
GRAHAM, RL
WINKLER, PM
[J]. GRAPHS AND COMBINATORICS, 1985, 1 (01) : 41 - 50
[6] WORST-CASE ANALYSIS OF HEURISTICS FOR THE LOCAL MICROCODE OPTIMIZATION PROBLEM
BOTTCHER, A
LAWITZKY, G
SIMON, HU
[J]. OPERATIONS RESEARCH LETTERS, 1988, 7 (03) : 127 - 130
[7] AVERAGE AND WORST-CASE ANALYSIS OF HEURISTICS FOR THE MAXIMUM TARDINESS PROBLEM
HALL, NG
RHEE, WST
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 26 (02) : 272 - 277
[8] Worst-case performance of Wong's!Steiner tree heuristic
Candia-Véjar, A
Bravo-Azlán, H
[J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (05) : 730 - 737
[9] A TIGHT WORST CASE BOUND FOR THE PERFORMANCE RATIO OF HEURISTICS FOR THE MINIMUM RECTILINEAR STEINER TREE PROBLEM
DESOUZA, CC
RIBEIRO, CC
[J]. OR SPEKTRUM, 1990, 12 (02) : 109 - 111
[10] WORST-CASE ANALYSIS OF SOME CONVEX-HULL HEURISTICS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
WARBURTON, AR
[J]. OPERATIONS RESEARCH LETTERS, 1993, 13 (01) : 37 - 42

← 1 2 3 4 5 →