Worst-case relative performances of heuristics for the Steiner problem in graphs.
Acta Mathematica Universitatis Comenianae. New Series (1991)
- Volume: 60, Issue: 2, page 269-284
- ISSN: 0862-9544
Access Full Article
top
How to cite
topPlesník, Ján. "Worst-case relative performances of heuristics for the Steiner problem in graphs.." Acta Mathematica Universitatis Comenianae. New Series 60.2 (1991): 269-284. <http://eudml.org/doc/118184>.
@article{Plesník1991,
author = {Plesník, Ján},
journal = {Acta Mathematica Universitatis Comenianae. New Series},
keywords = {worst-case; approximation algorithm; heuristics; Steiner problem in graphs},
language = {eng},
number = {2},
pages = {269-284},
publisher = {Comenius University Press},
title = {Worst-case relative performances of heuristics for the Steiner problem in graphs.},
url = {http://eudml.org/doc/118184},
volume = {60},
year = {1991},
}
TY - JOUR
AU - Plesník, Ján
TI - Worst-case relative performances of heuristics for the Steiner problem in graphs.
JO - Acta Mathematica Universitatis Comenianae. New Series
PY - 1991
PB - Comenius University Press
VL - 60
IS - 2
SP - 269
EP - 284
LA - eng
KW - worst-case; approximation algorithm; heuristics; Steiner problem in graphs
UR - http://eudml.org/doc/118184
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.