Approximating Max kCSP - outperforming a random assignment with almost a linear factor

Authors:
Gustav Hast
Affiliations:
Department of Numerical Analysis and Computer Science, Royal Institute of Technology, Stockholm, Sweden
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 9
Cited 6

Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
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 PCP characterization of NP with optimal amortized query complexity

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Derandomizing Approximation Algorithms Based on Semidefinite Programming

SIAM Journal on Computing
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Tight Characterization of NP with 3 Query PCPs

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Maximizing Quadratic Programs: Extending Grothendieck's Inequality

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Balanced max 2-sat might not be the hardest

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP

Random Structures & Algorithms
Near-optimal algorithms for maximum constraint satisfaction problems

ACM Transactions on Algorithms (TALG)
Approximation resistance from pairwise independent subgroups

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An instance of MaxkCSP consists of weighted k-ary constraints acting over a set of Boolean variables. The objective is to find an assignment to the Boolean variables such that the total weight of satisfied constraints is maximized. In this paper we provide a probabilistical polynomial time approximation algorithm that c0k(log k)−1 2$^{\rm -{\it k}}$-approximates MaxkCSP, for a constant c00.