Near-optimal algorithms for maximum constraint satisfaction problems.
Moses CharikarKonstantin MakarychevYury MakarychevPublished in: ACM Trans. Algorithms (2009)
Keyphrases
- constraint satisfaction problems
- pseudo boolean optimization
- constraint satisfaction
- computational problems
- combinatorial problems
- decomposition methods
- tractable subclasses
- non binary
- arc consistency algorithm
- np complete
- arc consistency
- orders of magnitude
- constraint programming
- constraint solving
- constraint problems
- constraint graph
- forward checking
- partial constraint satisfaction
- graph based representations
- problems in artificial intelligence
- backtracking search
- constraint optimization
- highly efficient
- random instances
- search space
- graph theory
- constraint propagation