Geodesic
THREE NEW HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS
Acta mathematica Universitatis Comenianae, Tome 60 (1991) no. 1 
M. Diane; J. Plesnik. THREE NEW HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS. Acta mathematica Universitatis Comenianae, Tome 60 (1991) no. 1. http://geodesic.mathdoc.fr/item/AMUC_1991_60_1_a7/
@article{AMUC_1991_60_1_a7,
     author = {M. Diane and J. Plesnik},
     title = {THREE {NEW} {HEURISTICS} {FOR} {THE} {STEINER} {PROBLEM} {IN} {GRAPHS}},
     journal = {Acta mathematica Universitatis Comenianae},
     year = {1991},
     volume = {60},
     number = {1},
     url = {http://geodesic.mathdoc.fr/item/AMUC_1991_60_1_a7/}
}
TY  - JOUR
AU  - M. Diane
AU  - J. Plesnik
TI  - THREE NEW HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS
JO  - Acta mathematica Universitatis Comenianae
PY  - 1991
VL  - 60
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/AMUC_1991_60_1_a7/
ID  - AMUC_1991_60_1_a7
ER  - 
%0 Journal Article
%A M. Diane
%A J. Plesnik
%T THREE NEW HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS
%J Acta mathematica Universitatis Comenianae
%D 1991
%V 60
%N 1
%U http://geodesic.mathdoc.fr/item/AMUC_1991_60_1_a7/
%F AMUC_1991_60_1_a7

Voir la notice de l'article provenant de la source Comenius University

Three practically successful heuristics are presented and analysed.\break They include the known spanning tree heuristic (STH). One of the heuristics chooses Steiner vertices by STH and the other two heuristics according to their sum of all distances to the special vertices. The theoretical worst-case performance ratio remains the same as for STH.