Computing optimal Steiner trees in polynomial space
From MaRDI portal
Publication:2392926
DOI10.1007/s00453-012-9612-zzbMath1269.05049WikidataQ60488414 ScholiaQ60488414MaRDI QIDQ2392926
Dieter Kratsch, Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov, Fabrizio Grandoni
Publication date: 5 August 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9612-z
05C05: Trees
05C35: Extremal problems in graph theory
90C39: Dynamic programming
05C85: Graph algorithms (graph-theoretic aspects)
05C22: Signed and weighted graphs