Login / Signup

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

Stefan FafianieHans L. BodlaenderJesper Nederlof
Published in: IPEC (2013)
Keyphrases
  • experimental evaluation
  • dynamic programming
  • tree decompositions
  • optimization problems
  • complexity bounds