Randomized approximation of the constraint satisfaction problem
From MaRDI portal
Publication:4375640
Recommendations
Cited in
(18)- Approximate Constraint Satisfaction Requires Large LP Relaxations
- Models for Random Constraint Satisfaction Problems
- A new approach for weighted constraint satisfaction
- Branch-and-bound solves random binary IPs in poly\((n)\)-time
- Approximations and randomization to boost CSP techniques
- scientific article; zbMATH DE number 5547880 (Why is no real title available?)
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
- Practically uniform solution sampling in constraint programming
- How far from a worst solution a random solution of a \(k\) CSP instance can be?
- scientific article; zbMATH DE number 7301529 (Why is no real title available?)
- Random constraint satisfaction: Flaws and structure
- On the advantage over a random assignment
- Randomized Post-optimization for t-Restrictions
- An average analysis of backtracking on random constraint satisfaction problems
- On the freezing of variables in random constraint satisfaction problems
- Backtracking and random constraint satisfaction
- scientific article; zbMATH DE number 1420826 (Why is no real title available?)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity
This page was built for publication: Randomized approximation of the constraint satisfaction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375640)
