Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}

@inproceedings{Guruswami2010TightBO,
  title={Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set\}},
  author={Venkatesan Guruswami and Yuan Zhou},
  booktitle={Electronic Colloquium on Computational Complexity},
  year={2010}
}
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the following optimal inapproximability and approximability results for finding an assignment satisfying as many constraints as possible given a near-satisfiable instance. 1. Given an instance of Max Horn-3SAT that admits an assignment satisfying (1 − ε) of its constraints for some small constant ε > 0, it is hard to find… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…