FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs.
Matthias LanzingerIgor RazgonPublished in: STACS (2024)
Keyphrases
- hypertree width
- hypertree decomposition
- conjunctive queries
- fixed parameter tractable
- bounded treewidth
- decomposition methods
- tree width
- np complete
- np hard
- approximation algorithms
- query evaluation
- query answering
- computational problems
- global constraints
- expressive power
- integrity constraints
- query language
- database theory
- special case
- first order logic
- tree decomposition
- structural properties
- polynomially solvable
- data exchange
- decision problems
- boolean functions
- constraint satisfaction
- normal form
- constraint programming
- shortest path
- constraint satisfaction problems