Three new heuristics for the Steiner problem in graphs.
Acta Mathematica Universitatis Comenianae. New Series (1991)
- Volume: 60, Issue: 1, page 105-121
- ISSN: 0862-9544
Access Full Article
top
How to cite
topDiané, M., and Plesník, Ján. "Three new heuristics for the Steiner problem in graphs.." Acta Mathematica Universitatis Comenianae. New Series 60.1 (1991): 105-121. <http://eudml.org/doc/118284>.
@article{Diané1991,
author = {Diané, M., Plesník, Ján},
journal = {Acta Mathematica Universitatis Comenianae. New Series},
keywords = {Steiner problem; heuristics; spanning tree heuristic; distances},
language = {eng},
number = {1},
pages = {105-121},
publisher = {Comenius University Press},
title = {Three new heuristics for the Steiner problem in graphs.},
url = {http://eudml.org/doc/118284},
volume = {60},
year = {1991},
}
TY - JOUR
AU - Diané, M.
AU - Plesník, Ján
TI - Three new heuristics for the Steiner problem in graphs.
JO - Acta Mathematica Universitatis Comenianae. New Series
PY - 1991
PB - Comenius University Press
VL - 60
IS - 1
SP - 105
EP - 121
LA - eng
KW - Steiner problem; heuristics; spanning tree heuristic; distances
UR - http://eudml.org/doc/118284
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.