Generalized hypertree decompositions: NP-hardness and tractable variants.
Georg GottlobZoltán MiklósThomas SchwentickPublished in: J. ACM (2009)
Keyphrases
- hypertree decomposition
- np hardness
- np hard
- decomposition methods
- hypertree width
- polynomially solvable
- approximation algorithms
- database theory
- constraint satisfaction problems
- special case
- mixed integer
- decomposition method
- conjunctive queries
- np complete
- linear programming
- scheduling problem
- dynamic environments
- probability distribution
- databases