An LP-designed algorithm for constraint satisfaction
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) over tilde (r(19m/100))-time algorithm. It is the fastest algorithm for most problems in the class (including M...
Glavni autori: | Scott, A, Sorkin, G |
---|---|
Format: | Conference item |
Izdano: |
2006
|
Slični predmeti
-
Polynomial Constraint Satisfaction Problems, Graph Bisection, and the Ising Partition Function
od: Scott, A, i dr.
Izdano: (2009) -
Linear-programming design and analysis of fast algorithms for Max 2-CSP
od: Scott, A, i dr.
Izdano: (2007) -
Applying quantum algorithms to constraint satisfaction problems
od: Earl Campbell, i dr.
Izdano: (2019-07-01) -
LP Well-Posedness for Bilevel Vector Equilibrium and Optimization Problems with Equilibrium Constraints
od: Phan Quoc Khanh, i dr.
Izdano: (2014-01-01) -
Message-Passing Algorithms and Improved LP Decoding
od: Arora, Sanjeev, i dr.
Izdano: (2021)