TY - GEN

T1 - Better inapproximability results for maxclique, chromatic number and Min-3Lin-Deletion

AU - Khot, Subhash

AU - Ponnuswami, Ashok Kumar

PY - 2006

Y1 - 2006

N2 - We prove an improved hardness of approximation result for two problems, namely, the problem of finding the size of the largest clique in a graph and the problem of finding the chromatic number of a graph. We show that for any constant γ > 0, there is no polynomial time algorithm that approximates these problems within factor n/2(log n)3/4+γ in an n vertex graph, assuming NP ⊈ BPTIME(2(log n)o(1)). This improves the hardness factor of n/2(log n)1-γ′ for some small (unspecified) constant γ′ > 0 shown by Knot [20]. Our main idea is to show an improved hardness result for the Min-3Lin-Deletion problem. An instance of Min-3Lin-Deletion is a system of linear equations modulo 2, where each equation is over three variables. The objective is to find the minimum number of equations that need to be deleted so that the remaining system of equations has a satisfying assignment. We show a hardness factor of 2 Ω(√log n) for this problem, improving upon the hardness factor of (log n)β shown by Håstad [18], for some small (unspecified) constant β > 0. The hardness results for clique and chromatic number are then obtained using the reduction from Min-3Lin-Deletion as given in [20].

AB - We prove an improved hardness of approximation result for two problems, namely, the problem of finding the size of the largest clique in a graph and the problem of finding the chromatic number of a graph. We show that for any constant γ > 0, there is no polynomial time algorithm that approximates these problems within factor n/2(log n)3/4+γ in an n vertex graph, assuming NP ⊈ BPTIME(2(log n)o(1)). This improves the hardness factor of n/2(log n)1-γ′ for some small (unspecified) constant γ′ > 0 shown by Knot [20]. Our main idea is to show an improved hardness result for the Min-3Lin-Deletion problem. An instance of Min-3Lin-Deletion is a system of linear equations modulo 2, where each equation is over three variables. The objective is to find the minimum number of equations that need to be deleted so that the remaining system of equations has a satisfying assignment. We show a hardness factor of 2 Ω(√log n) for this problem, improving upon the hardness factor of (log n)β shown by Håstad [18], for some small (unspecified) constant β > 0. The hardness results for clique and chromatic number are then obtained using the reduction from Min-3Lin-Deletion as given in [20].

UR - http://www.scopus.com/inward/record.url?scp=33746347703&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746347703&partnerID=8YFLogxK

U2 - 10.1007/11786986_21

DO - 10.1007/11786986_21

M3 - Conference contribution

AN - SCOPUS:33746347703

SN - 3540359044

SN - 9783540359043

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 226

EP - 237

BT - Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings

PB - Springer Verlag

T2 - 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006

Y2 - 10 July 2006 through 14 July 2006

ER -