Threshold Treewidth and Hypertree Width

Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in polynomial time. However, here the order of the polynomial in the running time depends on the width, and this is known to be unavoidable; therefore, the problem is not fixed-parameter tractable parameterized by either of these width measures. Here we introduce an enhancement of tree and hypertree width through a novel notion of thresholds, allowing the associated decompositions to take into account information about the computational costs associated with solving the given CSP instance. Aside from introducing these notions, we obtain efficient theoretical as well as empirical algorithms for computing threshold treewidth and hypertree width and show that these parameters give rise to fixed-parameter algorithms for CSP as well as other, more general problems. We complement our theoretical results with experimental evaluations in terms of heuristics as well as exact methods based on SAT/SMT encodings.

Original languageEnglish
Pages (from-to)1687-1713
Number of pages27
JournalJournal Of Artificial Intelligence Research
StatePublished - 1 Jan 2022
Externally publishedYes

ASJC Scopus subject areas

  • Artificial Intelligence


Dive into the research topics of 'Threshold Treewidth and Hypertree Width'. Together they form a unique fingerprint.

Cite this