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

Subhash Khot, Ashok Kumar Ponnuswami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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].

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings
Pages226-237
Number of pages12
Volume4051 LNCS
DOIs
StatePublished - 2006
Event33rd International Colloquium on Automata, Languages and Programming, ICALP 2006 - Venice, Italy
Duration: Jul 10 2006Jul 14 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4051 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other33rd International Colloquium on Automata, Languages and Programming, ICALP 2006
CountryItaly
CityVenice
Period7/10/067/14/06

Fingerprint

Inapproximability
Hardness
Chromatic number
Deletion
Color
Graph in graph theory
Hardness of Approximation
Clique number
System of Linear Equations
Linear equations
Clique
Polynomial-time Algorithm
Knot
System of equations
Modulo
Assignment
Polynomials
Vertex of a graph

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Khot, S., & Ponnuswami, A. K. (2006). Better inapproximability results for maxclique, chromatic number and Min-3Lin-Deletion. In Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings (Vol. 4051 LNCS, pp. 226-237). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4051 LNCS). https://doi.org/10.1007/11786986_21

Better inapproximability results for maxclique, chromatic number and Min-3Lin-Deletion. / Khot, Subhash; Ponnuswami, Ashok Kumar.

Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. Vol. 4051 LNCS 2006. p. 226-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4051 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khot, S & Ponnuswami, AK 2006, Better inapproximability results for maxclique, chromatic number and Min-3Lin-Deletion. in Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. vol. 4051 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4051 LNCS, pp. 226-237, 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, Venice, Italy, 7/10/06. https://doi.org/10.1007/11786986_21
Khot S, Ponnuswami AK. Better inapproximability results for maxclique, chromatic number and Min-3Lin-Deletion. In Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. Vol. 4051 LNCS. 2006. p. 226-237. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11786986_21
Khot, Subhash ; Ponnuswami, Ashok Kumar. / Better inapproximability results for maxclique, chromatic number and Min-3Lin-Deletion. Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. Vol. 4051 LNCS 2006. pp. 226-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ce20597cf7df4586940cafce96d0fa15,
title = "Better inapproximability results for maxclique, chromatic number and Min-3Lin-Deletion",
abstract = "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{\aa}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].",
author = "Subhash Khot and Ponnuswami, {Ashok Kumar}",
year = "2006",
doi = "10.1007/11786986_21",
language = "English (US)",
isbn = "3540359044",
volume = "4051 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "226--237",
booktitle = "Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings",

}

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

VL - 4051 LNCS

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

ER -