Sciweavers

Share
ESA
2008
Springer

Faster Steiner Tree Computation in Polynomial-Space

8 years 6 months ago
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
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where ESA
Authors Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
Comments (0)
books