Simple Approximation Algorithms for Balanced MAX 2SAT

@inproceedings{Paul2016SimpleAA,
  title={Simple Approximation Algorithms for Balanced MAX 2SAT},
  author={Alice Paul and Matthias Poloczek and David P. Williamson},
  booktitle={LATIN},
  year={2016}
}
We study simple algorithms for the balanced MAX 2SAT problem, where we are given weighted clauses of length one and two with the property that for each variable x the total weight of clauses that x appears in equals the total weight of clauses for \(\overline{x}\). We show that such instances have a simple structural property in that any optimal solution can satisfy at most the total weight of the clauses minus half the total weight of the unit clauses. Using this property, we are able to show… 

References

SHOWING 1-10 OF 24 REFERENCES

Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds

TLDR
A positive answer to a question posed by Williamson in 1998 on whether such an algorithm exists is provided, and it is shown that Johnson's greedy algorithm cannot guarantee a $\frac{3}{4}$-approximation, even if the variables are processed in a random order.

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

TLDR
This algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.

New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem

TLDR
It is shown that although standard randomized rounding does not give a good approximate result, the best solution of the two given by randomized rounding and a well-known algorithm of Johnson is always within $\frac{3}{4}$ of the optimal solution.

Max cut and the smallest eigenvalue

TLDR
A new approximation algorithm for Max Cut is described, which can be implemented in nearly linear time, and finds a solution that cuts a 1-4√ε + 8ε-o(1) fraction of edges in graphs in which the optimum is 1/2 + ε.

Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems

TLDR
Improved approximation algorithms for the MAX 2-SAT and MAX DI-CUT problems are obtained, which are essentially the best performance ratios that can be achieved using any combination of prerounding rotations and skewed distributions of hyperplanes, and even using more general families of rounding procedures.

Approximation algorithms for combinatorial problems

TLDR
For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(nε), where n is the problem size and ε> 0 depends on the algorithm.

An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem

TLDR
A new hybrid algorithm is proposed that combines the strengths of greedy algorithms and stochastic local search to provide outstanding solutions at high speed: in the authors' experiments, its performance is as good as simulated annealing, achieving an average loss with respect to the best-known assignment.

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization

TLDR
This work presents a simple randomized linear time algorithm achieving a tight approximation guarantee of 1/2, thus matching the known hardness result of Feige et al.

Towards Sharp Inapproximability For Any 2-CSP

  • Per Austrin
  • Computer Science
    48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
  • 2007
TLDR
It is shown how to reduce the search for a good inapproximability result to a certain numeric minimization problem, and conjecture that the restricted type required for the hardness result is in fact no restriction, which would imply that these upper and lower bounds match exactly.

Randomized variants of Johnson's algorithm for MAX SAT

TLDR
A randomized variant of Johnson's algorithm for MAX SAT is given and it is shown that the expected approximation ratio is worse than 3/4, thus providing a partial answer to a question of [5].