Turbocharging treewidth heuristics

DOI10.4230/LIPICS.IPEC.2016.13MaRDI QIDQ4634396zbMATH OpenFDO

Authors Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele

Publication date 10 April 2018

zbMATH Keywords

heuristiclocal searchfixed-parameter tractabilitytree decomposition

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Turbocharging treewidth heuristics
• Treewidth computations. I: Upper bounds
• Heuristic and metaheuristic methods for computing graph treewidth
• Experimental and Efficient Algorithms
• An Iterative Heuristic Algorithm for Tree Decomposition

Cited in

(8)

• Experimental and Efficient Algorithms
• Turbocharging treewidth heuristics
• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• Dynamic parameterized problems
• tw-heuristic
• Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation
• Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
• The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration

This page was built for publication: Turbocharging treewidth heuristics

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