A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Constraint solving via fractional edge covers
2006
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
Many important combinatorial problems can be modeled as constraint satisfaction problems. Hence identifying polynomial-time solvable classes of constraint satisfaction problems has received a lot of attention. In this paper, we are interested in structural properties that can make the problem tractable. So far, the largest structural class that is known to be polynomial-time solvable is the class of bounded hypertree width instances introduced by Gottlob et al. [2002]. Here we identify a new
doi:10.1145/1109557.1109590
fatcat:pcqab7njwffuheifoggrggpxc4