{"id":"https://openalex.org/W2067500596","doi":"https://doi.org/10.1007/s00453-014-9934-0","title":"Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions","display_name":"Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions","publication_year":2014,"publication_date":"2014-08-28","ids":{"openalex":"https://openalex.org/W2067500596","doi":"https://doi.org/10.1007/s00453-014-9934-0","mag":"2067500596"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-014-9934-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9934-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/files/3760181/387446066264409.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013286186","display_name":"Stefan Fafianie","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Stefan Fafianie","raw_affiliation_strings":["Utrecht University, Utrecht, The Netherlands","Utrecht University \u2013 Utrecht, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht University \u2013 Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Utrecht University, Utrecht, The Netherlands","Utrecht University \u2013 Utrecht, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht University \u2013 Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Utrecht University, Utrecht, The Netherlands","Utrecht University \u2013 Utrecht, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht University \u2013 Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013286186","https://openalex.org/A5032730524","https://openalex.org/A5068357631"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.3954,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.81943428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"71","issue":"3","first_page":"636","last_page":"660"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6611039638519287},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.638079047203064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5859768986701965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5830498933792114},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5406728386878967},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.515940248966217},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5017421245574951},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5014538764953613},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.45639273524284363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37685155868530273},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34872183203697205},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24474728107452393},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16922760009765625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09450104832649231}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6611039638519287},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.638079047203064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5859768986701965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5830498933792114},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5406728386878967},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.515940248966217},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5017421245574951},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5014538764953613},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.45639273524284363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37685155868530273},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34872183203697205},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24474728107452393},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16922760009765625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09450104832649231},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-014-9934-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9934-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/67874da5-3484-4fe6-b976-67fb8b67eece","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/67874da5-3484-4fe6-b976-67fb8b67eece","pdf_url":"https://research.tue.nl/files/3760181/387446066264409.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fafianie, S, Bodlaender, H L & Nederlof, J 2015, 'Speeding up dynamic programming with representative sets: An experimental evaluation of algorithms for Steiner tree on tree decompositions', Algorithmica, vol. 71, no. 3, pp. 636-660. https://doi.org/10.1007/s00453-014-9934-0","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/67874da5-3484-4fe6-b976-67fb8b67eece","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/67874da5-3484-4fe6-b976-67fb8b67eece","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 71(3), 636 - 660. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:publications/67874da5-3484-4fe6-b976-67fb8b67eece","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/67874da5-3484-4fe6-b976-67fb8b67eece","pdf_url":"https://research.tue.nl/files/3760181/387446066264409.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fafianie, S, Bodlaender, H L & Nederlof, J 2015, 'Speeding up dynamic programming with representative sets: An experimental evaluation of algorithms for Steiner tree on tree decompositions', Algorithmica, vol. 71, no. 3, pp. 636-660. https://doi.org/10.1007/s00453-014-9934-0","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2067500596.pdf","grobid_xml":"https://content.openalex.org/works/W2067500596.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W124060458","https://openalex.org/W1565709240","https://openalex.org/W1572147894","https://openalex.org/W1586904125","https://openalex.org/W1968952709","https://openalex.org/W1972514464","https://openalex.org/W1983860528","https://openalex.org/W2003272551","https://openalex.org/W2007503572","https://openalex.org/W2008771115","https://openalex.org/W2029448190","https://openalex.org/W2048013200","https://openalex.org/W2059273723","https://openalex.org/W2064086982","https://openalex.org/W2064796716","https://openalex.org/W2067500596","https://openalex.org/W2093478727","https://openalex.org/W2116793595","https://openalex.org/W2139888361","https://openalex.org/W2143406303","https://openalex.org/W2167377888","https://openalex.org/W2172222998","https://openalex.org/W2180988813","https://openalex.org/W2401610261","https://openalex.org/W2963227734","https://openalex.org/W3148632216","https://openalex.org/W3149604617"],"related_works":["https://openalex.org/W1515656813","https://openalex.org/W1576158606","https://openalex.org/W1836127928","https://openalex.org/W1490290385","https://openalex.org/W2108770488","https://openalex.org/W1972515959","https://openalex.org/W1572255008","https://openalex.org/W2027388354","https://openalex.org/W2289764920","https://openalex.org/W2583710543"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-02T14:50:37.381335","created_date":"2025-10-10T00:00:00"}