Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
<p>Tree projections provide a unifying framework to deal with most structural decomposition methods of constraint satisfaction problems (CSPs). Within this framework, a CSP instance is decomposed into a number of sub-problems, called views, whose solutions are either already available or can b...
Main Authors: | Gottlob, G, Greco, G, Scarcello, F |
---|---|
Format: | Journal article |
Published: |
Elsevier
2017
|
Similar Items
-
On Tractable Queries and Constraints
by: Gottlob, G, et al.
Published: (1999) -
Semantic width and the fixed-parameter tractability of constraint satisfaction problems
by: Chen, H, et al.
Published: (2020) -
Hypertree Decompositions and Tractable Queries
by: Gottlob, G, et al.
Published: (1999) -
Hypertree Decompositions and Tractable Queries
by: Gottlob, G, et al.
Published: (1999) -
Hypertree Decompositions and Tractable Queries
by: Gottlob, G, et al.
Published: (1998)