Header menu link for other important links
X
Parameterized single-exponential time polynomial space algorithm for steiner tree
F.V. Fomin, P. Kaski, D. Lokshtanov, , S. Saurabh
Published in Springer Verlag
2015
Volume: 9134
   
Pages: 494 - 505
Abstract
In the Steiner tree problem, we are given as input a connected n-vertex graph with edge weights in {1, 2,…, W}, and a subset of k terminal vertices. Our task is to compute a minimum-weight tree that contains all the terminals. We give an algorithm for this problem with running time O(7. 97k ·n4 · logW) using O(n3 · lognW · log k) space. This is the first single-exponential time, polynomial-space FPT algorithm for the weighted Steiner Tree problem. © Springer-Verlag Berlin Heidelberg 2015.