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. 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
{"_id":"J4Y62ggS2zvtQQ7i5","bibbaseid":"fafianie-bodlaender-nederlof-speedingupdynamicprogrammingwithrepresentativesetsanexperimentalevaluationofalgorithmsforsteinertreeontreedecompositions-2015","downloads":0,"creationDate":"2018-12-05T09:14:34.509Z","title":"Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions","author_short":["Fafianie, S.","Bodlaender, H. L.","Nederlof, J."],"year":2015,"bibtype":"article","biburl":"https://dblp.org/pid/33/7187.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Stefan"],"propositions":[],"lastnames":["Fafianie"],"suffixes":[]},{"firstnames":["Hans","L."],"propositions":[],"lastnames":["Bodlaender"],"suffixes":[]},{"firstnames":["Jesper"],"propositions":[],"lastnames":["Nederlof"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/algorithmica/FafianieBN15,\n author = {Stefan Fafianie and\n Hans L. Bodlaender and\n Jesper Nederlof},\n title = {Speeding Up Dynamic Programming with Representative Sets: An Experimental\n Evaluation of Algorithms for Steiner Tree on Tree Decompositions},\n journal = {Algorithmica},\n volume = {71},\n number = {3},\n pages = {636--660},\n year = {2015},\n url = {https://doi.org/10.1007/s00453-014-9934-0},\n doi = {10.1007/s00453-014-9934-0},\n timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/algorithmica/FafianieBN15},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Fafianie, S.","Bodlaender, H. L.","Nederlof, J."],"key":"DBLP:journals/algorithmica/FafianieBN15","id":"DBLP:journals/algorithmica/FafianieBN15","bibbaseid":"fafianie-bodlaender-nederlof-speedingupdynamicprogrammingwithrepresentativesetsanexperimentalevaluationofalgorithmsforsteinertreeontreedecompositions-2015","role":"author","urls":{"Paper":"https://doi.org/10.1007/s00453-014-9934-0"},"downloads":0},"search_terms":["speeding","dynamic","programming","representative","sets","experimental","evaluation","algorithms","steiner","tree","tree","decompositions","fafianie","bodlaender","nederlof"],"keywords":[],"authorIDs":[],"dataSources":["qoaa8S6oo6iCH58av"]}