Implications of forbidden structures for extremal algorithmic problems
Theoretical Computer Science
Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Complexity of Partial Satisfaction
Journal of the ACM (JACM)
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On Local Versus Global Satisfiability
SIAM Journal on Discrete Mathematics
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Extremal Combinatorics: With Applications in Computer Science
Extremal Combinatorics: With Applications in Computer Science
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Hi-index | 0.00 |
We study constraint satisfaction problems (CSPs) that are k-consistent in the sense that any k input constraints can be simultaneously satisfied. In this setting, we focus on constraint languages with a single binary constraint type. Such a constraint satisfaction problem is equivalent to the question whether there is a homomorphism from an input digraph G to a fixed target digraph H. The instance corresponding to G is k-consistent if every subgraph of G of size at most k is homomorphic to H. Let ρk(H) be the largest ρ such that every k-consistent G contains a subgraph G′ of size at least ρ ∥ E(G)∥ that is homomorphic to H. The ratio ρk(H) reflects the fraction of constraints of a k-consistent instance that can be always satisfied. We determine ρk(H) for all digraphs H that are not acyclic and show that limk→∞ρk(H) = 1 if and only if H has tree duality. In addition, for graphs H with tree duality, we design an algorithm that computes in linear time for a given input graph G either a homomorphism from almost the entire graph G to H, or a subgraph of G of bounded size that is not homomorphic to H.