@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}}

{"_id":"NudcJKrRDLWt33wfA","bibbaseid":"fomin-grandoni-kratsch-lokshtanov-saurabh-computingoptimalsteinertreesinpolynomialspace-2013","downloads":0,"creationDate":"2015-06-23T17:42:39.374Z","title":"Computing optimal Steiner trees in polynomial space","author_short":["Fomin, F. V.","Grandoni, F.","Kratsch, D.","Lokshtanov, D.","Saurabh, S."],"year":2013,"bibtype":"article","biburl":"https://bibbase.org/network/files/NMvet57iG3cfoNh6G","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Fomin"],"firstnames":["Fedor","V."],"suffixes":[]},{"propositions":[],"lastnames":["Grandoni"],"firstnames":["Fabrizio"],"suffixes":[]},{"propositions":[],"lastnames":["Kratsch"],"firstnames":["Dieter"],"suffixes":[]},{"propositions":[],"lastnames":["Lokshtanov"],"firstnames":["Daniel"],"suffixes":[]},{"propositions":[],"lastnames":["Saurabh"],"firstnames":["Saket"],"suffixes":[]}],"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 Steiner 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","bibtex":"@article{2013f,\n\tauthor = {Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter and Lokshtanov, Daniel and Saurabh, Saket},\n\tcoden = {ALGOEJ},\n\tdate-added = {2016-02-23 01:14:01 +0000},\n\tdate-modified = {2016-02-23 01:14:01 +0000},\n\tdoi = {10.1007/s00453-012-9612-z},\n\tfjournal = {Algorithmica. An International Journal in Computer Science},\n\tissn = {0178-4617},\n\tjournal = {Algorithmica},\n\tmrclass = {05C85 (05C22 68Q25)},\n\tmrnumber = {3016282},\n\tnumber = {3},\n\tpages = {584--604},\n\ttitle = {Computing optimal {S}teiner trees in polynomial space},\n\turl = {http://dx.doi.org/10.1007/s00453-012-9612-z},\n\turl_paper = {http://www.ii.uib.no/~fomin/articles/2013/2013f.pdf},\n\tvolume = {65},\n\tyear = {2013},\n\tbdsk-url-1 = {http://dx.doi.org/10.1007/s00453-012-9612-z}}\n\n","author_short":["Fomin, F. V.","Grandoni, F.","Kratsch, D.","Lokshtanov, D.","Saurabh, S."],"key":"2013f","id":"2013f","bibbaseid":"fomin-grandoni-kratsch-lokshtanov-saurabh-computingoptimalsteinertreesinpolynomialspace-2013","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s00453-012-9612-z"," paper":"http://www.ii.uib.no/~fomin/articles/2013/2013f.pdf"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["computing","optimal","steiner","trees","polynomial","space","fomin","grandoni","kratsch","lokshtanov","saurabh"],"keywords":[],"authorIDs":[],"dataSources":["Cypug6AWS8rvGPR5j","RtxX8siCrYJoMBHxn"]}