Computing optimal Steiner trees in polynomial space. Fomin, F. V., Grandoni, F., Kratsch, D., Lokshtanov, D., & Saurabh, S. Algorithmica, 65(3):584--604, 2013.
![Computing optimal Steiner trees in polynomial space [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper ![Computing optimal Steiner trees in polynomial space [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi bibtex
Paper Paper doi bibtex @article{2013f,
Author = {Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter and Lokshtanov, Daniel and Saurabh, Saket},
Coden = {ALGOEJ},
Date-Added = {2016-02-23 01:14:01 +0000},
Date-Modified = {2016-02-23 01:14:01 +0000},
Doi = {10.1007/s00453-012-9612-z},
Fjournal = {Algorithmica. An International Journal in Computer Science},
Issn = {0178-4617},
Journal = {Algorithmica},
Mrclass = {05C85 (05C22 68Q25)},
Mrnumber = {3016282},
Number = {3},
Pages = {584--604},
Title = {Computing optimal {S}teiner trees in polynomial space},
Url = {http://dx.doi.org/10.1007/s00453-012-9612-z},
Url_Paper = {http://www.ii.uib.no/~fomin/articles/2013/2013f.pdf},
Volume = {65},
Year = {2013},
Bdsk-Url-1 = {http://dx.doi.org/10.1007/s00453-012-9612-z}}Downloads: 0