A new approach for Weighted Constraint Satisfaction: Theoretical and computational results

  • Hoong Chuin Lau
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1118)


We consider the Weighted Constraint Satisfaction Problem which is a central problem in Artificial Intelligence. Given a set of variables, their domains and a set of constraints between variables, our goal is to obtain an assignment of the variables to domain values such that the weighted sum of satisfied constraints is maximized. In this paper, we present a new approach based on randomized rounding of semidefinite programming relaxation. Besides having provable worst-case bounds, our algorithm is simple and efficient in practice, and produces better solutions than other polynomial-time algorithms such as greedy and randomized local search.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimiz., 5(1):13–51, 1995.Google Scholar
  2. 2.
    Noga Alon and Joe Spencer. The Probabilistic Method. Wiley Interscience Ser. Disc. Math. and Optimiz., 1992.Google Scholar
  3. 3.
    Eugene C Freuder. Partial constraint satisfaction. In Proc. Int'l Joint Conf. Artif. Intell. (IJCAI-89), pages 278–283, Detriot, MI, 1989.Google Scholar
  4. 4.
    Eugene C. Freuder and Richard J. Wallace. Partial Constraint Satisfaction. Artif. Intell., 58(1–3):21–70, 1992.Google Scholar
  5. 5.
    Katsuki Fujisawa and Masakazu Kojima. Sdpa (semidefinite programming algorithm) user's manual. Technical Report B-308, Dept. Information Science, Tokyo Inst. of Technology, 1995. Online implementation available at ftp.is.titech.ac.jp under directory /pub/OpsRes/software.Google Scholar
  6. 6.
    Michel X. Goemans and David P. Williamson. Approximation algorithms for MAX CUT and MAX 2SAT. In Proc. 26th ACM Symp. on Theory of Computing, pages 422–431, 1994. Full version to appear in J. ACM.Google Scholar
  7. 7.
    P. Lancaster and M Tismenetsky. The Theory of Matrices. Academic Press, Orlando, FL, 1985.Google Scholar
  8. 8.
    H. C. Lau. Approximation of constraint satisfaction via local search. In Proc. 4th Wrksp. on Algorithms and Data Structures (WADS), pages 461–472. Springer Verlag Lect. Notes Comp. Sci. (955), 1995.Google Scholar
  9. 9.
    H. C. Lau and O. Watanabe. Randomized approximation of the constraint satisfaction problem. In Proc. Fifth Scandinavian Wrksp. on Algorithm Theory (SWAT). Springer Verlag Lect. Notes Comp. Sci., 1996. To appear.Google Scholar
  10. 10.
    S. Mahajan and H. Ramesh. Derandomizing semidefinite programming based approximation algorithms. In Proc. 36th IEEE Symp. on Found. of Comp. Sci., pages 162–168, 1995.Google Scholar
  11. 11.
    P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365–374, 1987.Google Scholar
  12. 12.
    Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.Google Scholar
  13. 13.
    Peter van Beek. On-line C-programs available at ftp.cs.ualberta.ca under directory /pub/ai/csp.Google Scholar
  14. 14.
    Chris Voudouris and Edward Tsang. Parital constraint satisfaction problems and guided local search. Technical Report No. CSM-250, Dept. Computer Science, University of Essex, 1995.Google Scholar
  15. 15.
    Richard J. Wallace, 1995. Personal communication.Google Scholar
  16. 16.
    Richard J. Wallace. Directed arc consistency preprocessing as a strategy for maximal constraint satisfaction. In M. Meyer, editor, Constraint Processing, pages 121–138. Springer Verlag Lect. Notes Comp. Sci. (923), 1995.Google Scholar
  17. 17.
    Richard J. Wallace and Eugene C. Freuder. Conjuctive width heuristics for maximal constraint satisfaction. In Proc. Nat'l Conf. on Artif. Intell. (AAAI-93), pages 762–768, 1993.Google Scholar
  18. 18.
    Richard J. Wallace and Eugene C. Freuder. Heuristic methods for over-constrained constraint satisfaction problems. In CP95 Wrksp. on Over-constrained Systems, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Hoong Chuin Lau
    • 1
  1. 1.Dept. of Computer ScienceTokyo Institute of TechnologyTokyoJapan

Personalised recommendations