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...
Autors principals: | Scott, A, Sorkin, G |
---|---|
Format: | Conference item |
Publicat: |
2006
|
Ítems similars
-
Polynomial Constraint Satisfaction Problems, Graph Bisection, and the Ising Partition Function
per: Scott, A, et al.
Publicat: (2009) -
Linear-programming design and analysis of fast algorithms for Max 2-CSP
per: Scott, A, et al.
Publicat: (2007) -
LP Well-Posedness for Bilevel Vector Equilibrium and Optimization Problems with Equilibrium Constraints
per: Phan Quoc Khanh, et al.
Publicat: (2014-01-01) -
Message-Passing Algorithms and Improved LP Decoding
per: Arora, Sanjeev, et al.
Publicat: (2021) -
Lp quasi-norm minimization: algorithm and applications
per: Omar M. Sleem, et al.
Publicat: (2024-02-01)