Randomized approximation of the constraint satisfaction problem
We consider the Weighted Constraint Satisfaction Problem (W-CSP) which is a fundamental problem in Artificial Intelligence and a generalization of important combinatorial problems such as MAX CUT and MAX SAT. In this paper, we prove non-approximability properties of W-CSP and give improved approxima...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1996
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/150 https://ink.library.smu.edu.sg/context/sis_research/article/1149/viewcontent/Randomized_approximation_of_the_constraint_pv.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |