Fuchs, Bernhard; Kern, Walter; Wang, Xinhui - In: Mathematical Methods of Operations Research 66 (2007) 1, pp. 117-125
The Dreyfus–Wagner algorithm is a well-known dynamic programming method for computing minimum Steiner trees in general weighted graphs in time O <Superscript>*</Superscript>(3<Superscript> k </Superscript>), where k is the number of terminal nodes to be connected. We improve its running time to O <Superscript>*</Superscript>(2.684<Superscript> k </Superscript>) by showing that the optimum Steiner...</superscript></superscript></superscript></superscript>
