Library Header Image
LSE Research Online LSE Library Services

An LP-designed algorithm for constraint satisfaction

Scott, Alexander D. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2006) An LP-designed algorithm for constraint satisfaction. In: Azar, Yossi and Erlebach, Thomas, (eds.) Algorithms - Esa 2006. 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings. Lecture notes in computer science (4168). Springer Berlin / Heidelberg, pp. 588-599. ISBN 9783540388753

Full text not available from this repository.
Identification Number: 10.1007/11841036


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.

Item Type: Book Section
Official URL:
Additional Information: © 2006 Springer - Verglag Berlin Heidelberg
Divisions: Management
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited: 13 May 2011 12:43
Last Modified: 16 May 2024 05:05

Actions (login required)

View Item View Item