A combinatorial algorithm for MAX CSP

[1]  R. M. Dijkstra.  Information Processing Letters , 2003 .

[2]  David P. Williamson,et al.  Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming , 2001, STOC '01.

[3]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[4]  Uri Zwick,et al.  Combinatorial approximation algorithms for the maximum directed cut problem , 2001, SODA '01.

[5]  Surajit Chaudhuri,et al.  Automated Selection of Materialized Views and Indexes in SQL Databases , 2000, VLDB.

[6]  Lars Engebretsen.  Lower Bounds for non-Boolean Constraint Satisfaction Programs , 2000 .

[7]  Johan Håstad,et al.  A new way to use semidefinite programming with applications to linear equations mod p , 2001, SODA '99.

[8]  Maria J. Serna,et al.  The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming , 1998, STACS.

[9]  Surajit Chaudhuri,et al.  An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server , 1997, VLDB.

[10]  Alan M. Frieze,et al.  Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

[11]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[12]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[13]  Mihir Bellare,et al.  Interactive proofs and approximation: reductions from two provers in one round , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.