Abstract
We show that given a 3-colorable graph, it is NP-hard to find a 3-coloring with (16/17 + ε) of the edges bichromatic. In a related result, we show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a (23/24 + ε)-satisfying assignment.
- Sanjeev Arora, Boaz Barak, and David Steurer. 2010. Subexponential algorithms for unique games and related problems. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science. 563--572. Google Scholar
Digital Library
- Per Austrin and Elchanan Mossel. 2009. Approximation resistant predicates from pairwise independence. Comput. Complex. 18, 2, 249--271. Google Scholar
Digital Library
- Per Austrin, Ryan O’Donnell, and John Wright. 2012. A new point of NP-hardness for 2-to-1 label-cover. In Proceedings of the 15th Annual International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. 1--12. Google Scholar
Digital Library
- Boaz Barak, Prasad Raghavendra, and David Steurer. 2011. Rounding semidefinite programming hierarchies via global correlation. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science. Google Scholar
Digital Library
- Irit Dinur, Elchanan Mossel, and Oded Regev. 2009. Conditional hardness for approximate coloring. SIAM J. Comput. 39, 3, 843--873. Google Scholar
Digital Library
- Alan Frieze and Mark Jerrum. 1997. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18, 1, 67--81.Google Scholar
Digital Library
- Michel Goemans and David Williamson. 2004. Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. J. Comput. Syst. Sci. 68, 2, 442--470. Google Scholar
Digital Library
- Venkatesan Guruswami and Ali Kemal Sinop. 2009. Improved inapproximability results for maximum k-colorable subgraph. In Proceedings of the 12th Annual International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. 163--176. Google Scholar
Digital Library
- Venkatesan Guruswami and Ali Sinop. 2011. Lasserre hierarchy, higher eigenvalues, and approximation schemes for quadratic integer programming with PSD objectives. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science. Google Scholar
Digital Library
- Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, and Luca Trevisan. 1998. A tight characterization of NP with 3 query PCPs. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science. 8--17. Google Scholar
Digital Library
- Venkatesan Guruswami, Subhash Khot, Ryan O’Donnell, Preyas Popat, Madhur Tulsiani, and Yi Wu. 2010. SDP gaps for 2-to-1 and other label-cover variants. In Proceedings of the 37th Annual International Colloquium on Automata, Languages and Programming. 617--628. Google Scholar
Digital Library
- Johan Håstad. 2001. Some optimal inapproximability results. J. ACM 48, 4, 798--859. Google Scholar
Digital Library
- Russell Impagliazzo and Ramamohan Paturi. 2001. On the complexity of k-SAT. J. Comput. Syst. Sci. 62, 2, 367--375. Google Scholar
Digital Library
- Subhash Khot. 2002. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. 767--775. Google Scholar
Digital Library
- Dana Moshkovitz and Ran Raz. 2010. Two-query PCP with subconstant error. J. ACM 57, 5, 29. Google Scholar
Digital Library
- Ryan O’Donnell and John Wright. 2012. A new point of NP-hardness for unique-games. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing. 289--306. Google Scholar
Digital Library
- Erez Petrank. 1994. The hardness of approximation: Gap location. Comput. Complex. 4, 2, 133--157. Google Scholar
Digital Library
- Prasad Raghavendra. 2008. Optimal algorithms and inapproximability results for every CSP? In Proceedings of the 40th Annual ACM Symposium on Theory of Computing. 245--254. Google Scholar
Digital Library
- David Steurer. 2010. Subexponential algorithms for d-to-1 two-prover games and for certifying almost perfect expansion. http://www.cs.cornell.edu/~dsteurer/papers/dgames/pdf.Google Scholar
- Luca Trevisan, Gregory Sorkin, Madhu Sudan, and David Williamson. 2000. Gadgets, approximation, and linear programming. SIAM J. Comput. 29, 6, 2074--2097. Google Scholar
Digital Library
Index Terms
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover
Recommendations
On the Hardness of 4-Coloring a 3-Colorable Graph
We give a new proof showing that it is NP-hard to color a 3-colorable graph using just 4 colors. This result is already known , [S. Khanna, N. Linial, and S. Safra, Combinatorica, 20 (2000), pp. 393--415], but our proof is novel because it does not rely ...
On the Hardness of 4-Coloring a 3-Colorable Graph
COCO '00: Proceedings of the 15th Annual IEEE Conference on Computational ComplexityWe give a new proof showing that it is NP-hard to color a 3-colorable graph using just four colors. This result is already known by work of Khanna, Linial and Safra (1993), but our proof is novel, as it does not rely on the PCP theorem, while the ...
Hardness of Approximate Hypergraph Coloring
We introduce the notion of covering complexity of a verifier for probabilistically checkable proofs (PCPs). Such a verifier is given an input, a claimed theorem, and an oracle, representing a purported proof of the theorem. The verifier is also given a ...






Comments