Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
Crossref DOI link: https://doi.org/10.1007/s00453-014-9934-0
Published Online: 2014-08-29
Published Print: 2015-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Fafianie, Stefan
Bodlaender, Hans L.
Nederlof, Jesper
Text and Data Mining valid from 2014-08-29