Speeding Up Dynamic Programming with Representative Sets
From MaRDI portal
Publication:2867093
DOI10.1007/978-3-319-03898-8_27zbMath1309.68209OpenAlexW2139888361WikidataQ59567519 ScholiaQ59567519MaRDI QIDQ2867093
Stefan Fafianie, Jesper Nederlof, Hans L. Bodlaender
Publication date: 10 December 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_27
dynamic programmingtreewidthSteiner treeexact algorithmsexperimental evaluationalgorithmic engineering
Nonnumerical algorithms (68W05) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
New analysis and computational study for the planar connected dominating set problem ⋮ Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm ⋮ Strong Steiner Tree Approximations in Practice ⋮ Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions ⋮ Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Uses Software
This page was built for publication: Speeding Up Dynamic Programming with Representative Sets
