activity
20132015
most citedSpeeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions

3 citations · 5 across the 5 of their papers we have counts for

collaborators
Showing 2013Show all

1 paper · 1 filter

cs.DS2013★ 3 cited

Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions

Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof

Dynamic programming on tree decompositions is a frequently used approach to solve otherwise intractable problems on instances of small treewidth. In recent work by Bodlaender et al…