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: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2017
|
| _version_ | 1797060087281352704 |
|---|---|
| author | Gottlob, G Greco, G Scarcello, F |
| author_facet | Gottlob, G Greco, G Scarcello, F |
| author_sort | Gottlob, G |
| collection | OXFORD |
| description | <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 be computed efficiently. The goal is to arrange portions of these views in a tree-like structure, called tree projection, which determines an efficiently solvable CSP instance equivalent to the original one. However, deciding whether a tree projection exists is NP-hard. Solution methods have therefore been proposed in the literature that do not require a tree projection to be given, and that either correctly decide whether the given CSP instance is satisfiable, or return that a tree projection actually does not exist. These approaches had not been generalized so far to deal with CSP extensions tailored for optimization problems, where the goal is to compute a solution of maximum value/minimum cost. The paper fills the gap, by exhibiting a fixed-parameter polynomial-time algorithm that either disproves the existence of tree projections or computes an optimal solution, with the parameter being the size of the expression of the objective function to be optimized over all possible solutions (and not the size of the whole constraint formula, used in related works). Tractability results are also established for the problem of returning the best K solutions. Finally, parallel algorithms for such optimization problems are proposed and analyzed.</p> <br/> <p>Given that the classes of acyclic hypergraphs, hypergraphs of bounded treewidth, and hypergraphs of bounded generalized hypertree width are all covered as special cases of the tree projection framework, the results in this paper directly apply to these classes. These classes are extensively considered in the CSP setting, as well as in conjunctive database query evaluation and optimization.</p> |
| first_indexed | 2024-03-06T20:12:41Z |
| format | Journal article |
| id | oxford-uuid:2b1a20c8-6a3f-45a0-97e7-0ddae76d846d |
| institution | University of Oxford |
| last_indexed | 2024-03-06T20:12:41Z |
| publishDate | 2017 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | oxford-uuid:2b1a20c8-6a3f-45a0-97e7-0ddae76d846d2022-03-26T12:28:57ZTree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithmsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:2b1a20c8-6a3f-45a0-97e7-0ddae76d846dSymplectic Elements at OxfordElsevier2017Gottlob, GGreco, GScarcello, F<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 be computed efficiently. The goal is to arrange portions of these views in a tree-like structure, called tree projection, which determines an efficiently solvable CSP instance equivalent to the original one. However, deciding whether a tree projection exists is NP-hard. Solution methods have therefore been proposed in the literature that do not require a tree projection to be given, and that either correctly decide whether the given CSP instance is satisfiable, or return that a tree projection actually does not exist. These approaches had not been generalized so far to deal with CSP extensions tailored for optimization problems, where the goal is to compute a solution of maximum value/minimum cost. The paper fills the gap, by exhibiting a fixed-parameter polynomial-time algorithm that either disproves the existence of tree projections or computes an optimal solution, with the parameter being the size of the expression of the objective function to be optimized over all possible solutions (and not the size of the whole constraint formula, used in related works). Tractability results are also established for the problem of returning the best K solutions. Finally, parallel algorithms for such optimization problems are proposed and analyzed.</p> <br/> <p>Given that the classes of acyclic hypergraphs, hypergraphs of bounded treewidth, and hypergraphs of bounded generalized hypertree width are all covered as special cases of the tree projection framework, the results in this paper directly apply to these classes. These classes are extensively considered in the CSP setting, as well as in conjunctive database query evaluation and optimization.</p> |
| spellingShingle | Gottlob, G Greco, G Scarcello, F Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms |
| title | Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms |
| title_full | Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms |
| title_fullStr | Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms |
| title_full_unstemmed | Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms |
| title_short | Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms |
| title_sort | tree projections and constraint optimization problems fixed parameter tractability and parallel algorithms |
| work_keys_str_mv | AT gottlobg treeprojectionsandconstraintoptimizationproblemsfixedparametertractabilityandparallelalgorithms AT grecog treeprojectionsandconstraintoptimizationproblemsfixedparametertractabilityandparallelalgorithms AT scarcellof treeprojectionsandconstraintoptimizationproblemsfixedparametertractabilityandparallelalgorithms |