34,244 research outputs found
Computing hypergraph width measures exactly
Hypergraph width measures are a class of hypergraph invariants important in
studying the complexity of constraint satisfaction problems (CSPs). We present
a general exact exponential algorithm for a large variety of these measures. A
connection between these and tree decompositions is established. This enables
us to almost seamlessly adapt the combinatorial and algorithmic results known
for tree decompositions of graphs to the case of hypergraphs and obtain fast
exact algorithms.
As a consequence, we provide algorithms which, given a hypergraph H on n
vertices and m hyperedges, compute the generalized hypertree-width of H in time
O*(2^n) and compute the fractional hypertree-width of H in time
O(m*1.734601^n).Comment: 12 pages, 1 figur
Approximation, abstraction and decomposition in search and optimization
In this paper, I discuss four different areas of my research. One portion of my research has focused on automatic synthesis of search control heuristics for constraint satisfaction problems (CSPs). I have developed techniques for automatically synthesizing two types of heuristics for CSPs: Filtering functions are used to remove portions of a search space from consideration. Another portion of my research is focused on automatic synthesis of hierarchic algorithms for solving constraint satisfaction problems (CSPs). I have developed a technique for constructing hierarchic problem solvers based on numeric interval algebra. Another portion of my research is focused on automatic decomposition of design optimization problems. We are using the design of racing yacht hulls as a testbed domain for this research. Decomposition is especially important in the design of complex physical shapes such as yacht hulls. Another portion of my research is focused on intelligent model selection in design optimization. The model selection problem results from the difficulty of using exact models to analyze the performance of candidate designs
Computing hypergraph width measures exactly
Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tree decompositions of graphs to the case of hypergraphs and obtain fast exact algorithms. As a consequence, we provide algorithms which, given a hypergraph H on n vertices and m hyperedges, compute the generalized hypertree-width of H in time O*(2n) and compute the fractional hypertree-width of H in time O(1.734601n.m).
- …