scientific article; zbMATH DE number 6857809

DOI10.4230/LIPIcs.IPEC.2016.13zbMath1398.68490MaRDI QIDQ4634396

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

Publication date: 10 April 2018

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

local searchtree decompositionheuristicfixed-parameter tractability

Mathematics Subject Classification ID

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

Related Items (6)

Unnamed Item ⋮ Turbocharging treewidth heuristics ⋮ Dynamic parameterized problems ⋮ Unnamed Item ⋮ tw-heuristic ⋮ Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation

This page was built for publication: