2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
Stefan Hougardy, Jannik Silvanus, Jens Vygen
We present a new exact algorithm for the Steiner tree problem in edge-weighted graphs. Our algorithm improves the classical dynamic programming approach by Dreyfus and Wagner. We a…