Randomized approximations of the constraint satisfaction problem

Authors:
Hoong Chuin Lau;Osamu Watanabe
Affiliations:
Information Technology Institute, 11 Science Park Rd, Singapore;Tokyo Institute of Technology, Department of Computer Science, Meguro-ku, Ookayama, Tokyo 152, Japan
Venue:
Nordic Journal of Computing
Year:
1996

Citing 11
Cited 2

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Two-prover one-round proof systems: their power and their problems (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A parallel repetition theorem

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximation of Constraint Satisfaction via Local Search (Extended Abstract)

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Directed Arc Consistency Preprocessing

Constraint Processing, Selected Papers
Positive Linear Programming, Parallel Approximation and PCP's

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Derandomizing semidefinite programming based approximation algorithms

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)

A New Approach for Weighted Constraint Satisfaction

Constraints
The approximability of non-Boolean satisfiability problems and restricted integer programming

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 approximations of W-CSP via randomized rounding of linear programming and semidefinite programming relaxations. Our algorithms are simple to implement and experiments show that they are run-time efficient.