Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Fafianie, S., Bodlaender, H. L., & Nederlof, J. Algorithmica, 71(3):636–660, 2015.
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions [link]Paper  doi  bibtex   
@article{DBLP:journals/algorithmica/FafianieBN15,
  author    = {Stefan Fafianie and
               Hans L. Bodlaender and
               Jesper Nederlof},
  title     = {Speeding Up Dynamic Programming with Representative Sets: An Experimental
               Evaluation of Algorithms for Steiner Tree on Tree Decompositions},
  journal   = {Algorithmica},
  volume    = {71},
  number    = {3},
  pages     = {636--660},
  year      = {2015},
  url       = {https://doi.org/10.1007/s00453-014-9934-0},
  doi       = {10.1007/s00453-014-9934-0},
  timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/FafianieBN15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0