Sciweavers

113 search results - page 2 / 23
» On bounded occurrence constraint satisfaction
Sort
View
103
Voted
CORR
2006
Springer
150views Education» more  CORR 2006»
15 years 1 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
121
Voted
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 3 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
127
Voted
EJC
2008
15 years 1 months ago
Majority constraints have bounded pathwidth duality
We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with...
Víctor Dalmau, Andrei A. Krokhin
95
Voted
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 1 months ago
The Exact Closest String Problem as a Constraint Satisfaction Problem
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
Tom Kelsey, Lars Kotthoff
TCS
2010
15 years 3 days ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....