Is constraint satisfaction over two variables always easy?

Authors:
Lars Engebretsen;Venkatesan Guruswami
Affiliations:
Department of Numerical Analysis and Computer Science, Royal Institute of Technology, SE-100 44 Stockholm, Sweden and MIT;Department of Computer Science and Engineering, University of Washington, Seattle, Washington and University of California, Berkeley
Venue:
Random Structures & Algorithms
Year:
2004

Citing 15
Cited 4

The hardness of approximation: gap location

Computational Complexity
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A Parallel Repetition Theorem

SIAM Journal on Computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A new way of using semidefinite programming with applications to linear equations mod p

Journal of Algorithms
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On weighted vs unweighted versions of combinatorial optimizationproblems

Information and Computation
Some optimal inapproximability results

Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A new multilayered PCP and the hardness of hypergraph vertex cover

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An approximation algorithm for max p-section

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Every 2-CSP allows nontrivial approximation

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Supermodular functions and the complexity of MAX CSP

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Supermodular functions and the complexity of MAX CSP

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm ...