For arbitrarily small constants ε, δ > 0, we present a long code test with one free bit, completeness 1 − ε and soundness δ. Using the test, we prove the following two inapproximability results:
1. Assuming the Unique Games Conjecture of Khot [17], given an n-vertex graph that has two disjoint independent sets of size ( 1/2 − ε)n each, it is NP-hard to find an independent set of size δn.
2. Assuming a (new) stronger version of the Unique Games Conjecture, the scheduling problem of minimizing weighted completion time with precedence constraints is inapproximable within factor 2 − ε.
By: Nikhil Bansal; Subhash Khot
Published in: RC24848 in 2009
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .