Sciweavers

Share
ECCC
2010

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

9 years 5 months ago
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}
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.
Venkatesan Guruswami, Yuan Zhou
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where ECCC
Authors Venkatesan Guruswami, Yuan Zhou
Comments (0)
books