Skip to main content
Article thumbnail
Location of Repository

An LP-designed algorithm for constraint satisfaction

By Alexander D. Scott and Gregory B. Sorkin

Abstract

The class Max (r,2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we present an [(O)\tilde](r19m/100)O(r19m100) -time algorithm. It is the fastest algorithm for most problems in the class (including Max Cut and Max 2-Sat), and in combination with “Generalized CSPs” introduced in a companion paper, also allows counting, sampling, and the solution of problems like Max Bisection that escape the usual CSP framework. Linear programming is key to the design as well as the analysis of the algorithm

Topics: QA75 Electronic computers. Computer science
Publisher: Springer
Year: 2006
DOI identifier: 10.1007/11841036
OAI identifier: oai:eprints.lse.ac.uk:35683
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.springer.com (external link)
  • http://eprints.lse.ac.uk/35683... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.