Faster Steiner Tree Computation in Polynomial-Space

Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for this problem

• Type: Conference
• Year: 2008
• Where: ESA
• Authors: Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
• Keywords: Algorithms, ESA 2008, Minimum-size Tree, N-node Graph, NP-hard Steiner Tree