Improving the efficiency of dynamic programming on tree decompositions via machine learning

DOI10.1613/JAIR.5312MaRDI QIDQ2985109zbMATH OpenOpenAlexWikidataFDO

Authors Michael Abseher, Nysret Musliu, Stefan Woltran

Publication date 16 May 2017

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.5312

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Efficient problem solving on tree decompositions using binary decision diagrams
• Tree decompositions of graphs: saving memory in dynamic programming
• The Fine Details of Fast Dynamic Programming over Tree Decompositions
• Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
• D-FLAT^2: subset minimization in dynamic programming on tree decompositions made easy

Cited in

(15)

• Variable neighborhood search for graphical model energy minimization
• Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
• Tree decompositions of graphs: saving memory in dynamic programming
• The Fine Details of Fast Dynamic Programming over Tree Decompositions
• Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
• The D-FLAT system for dynamic programming on tree decompositions
• Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
• Efficient problem solving on tree decompositions using binary decision diagrams
• D-FLAT^2: subset minimization in dynamic programming on tree decompositions made easy
• scientific article; zbMATH DE number 6862107 (Why is no real title available?)
• A faster tree-decomposition based algorithm for counting linear extensions
• Practical access to dynamic programming on tree decompositions
• DynASP2.5: Dynamic Programming on Tree Decompositions in Action
• Parameterized algorithms for computing Pareto sets
• A faster tree-decomposition based algorithm for counting linear extensions

This page was built for publication: Improving the efficiency of dynamic programming on tree decompositions via machine learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985109)