Abstract
We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a \((\frac{23}{24} + \epsilon)\)-satisfying assignment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Barak, B., Steurer, D.: Subexponential algorithms for Unique Games and related problems. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 563–572 (2010)
Austrin, P., Mossel, E.: Approximation resistant predicates from pairwise independence. Computational Complexity 18(2), 249–271 (2009)
Austrin, P., O’Donnell, R., Wright, J.: A new point of NP-hardness for 2-to-1 Label Cover. CoRR, abs/1204.5666 (2012)
Barak, B., Raghavendra, P., Steurer, D.: Rounding semidefinite programming hierarchies via global correlation. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (2011)
Dinur, I., Mossel, E., Regev, O.: Conditional hardness for approximate coloring. SIAM Journal on Computing 39(3), 843–873 (2009)
Feige, U., Kilian, J.: Two prover protocols: low error at affordable rates. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pp. 172–183 (1994)
Frieze, A., Jerrum, M.: Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18(1), 67–81 (1997)
Goemans, M., Williamson, D.: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Journal of Computer & System Sciences 68(2), 442–470 (2004)
Guruswami, V., Khot, S., O’Donnell, R., Popat, P., Tulsiani, M., Wu, Y.: SDP Gaps for 2-to-1 and Other Label-Cover Variants. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 617–628. Springer, Heidelberg (2010)
Guruswami, V., Lewin, D., Sudan, M., Trevisan, L.: A tight characterization of NP with 3 query PCPs. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pp. 8–17 (1998)
Guruswami, V., Sinop, A.: 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 (2011)
Guruswami, V., Sinop, A.K.: Improved inapproximability results for Maximum k-Colorable Subgraph. In: Proceedings of the 12th Annual International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 163–176 (2009)
HĂ¥stad, J.: Some optimal inapproximability results. Journal of the ACM 48(4), 798–859 (2001)
Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. Journal of Computer and System Sciences 62(2), 367–375 (2001)
Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th ACM Symposium on Theory of Computing, pp. 767–775 (2002)
Khot, S., Kindler, G., Mossel, E., O’Donnell, R.: Optimal inapproximability results for Max-Cut and other 2-variable CSPs? SIAM Journal on Computing 37(1), 319–357 (2007)
Khot, S., Regev, O.: Vertex Cover might be hard to approximate to within 2 − ε. In: Proc. 18th IEEE Conference on Computational Complexity, pp. 379–386 (2003)
Moshkovitz, D., Roz, R.: Two-query PCP with subconstant error. Journal of the ACMÂ 57(5), 29 (2010)
O’Donnell, R., Wright, J.: A new point of NP-hardness for Unique-Games. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pp. 289–306 (2012)
O’Donnell, R., Wu, Y.: Conditional hardness for satisfiable 3-CSPs. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 493–502 (2009)
Raghavendra, P.: Optimal algorithms and inapproximability results for every CSP? In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 245–254 (2008)
Raz, R.: A parallel repetition theorem. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 447–456 (1995)
Steurer, D.: Subexponential algorithms for d-to-1 two-prover games and for certifying almost perfect expansion. Available at the author’s website (2010)
Trevisan, L., Sorkin, G., Sudan, M., Williamson, D.: Gadgets, approximation, and linear programming. SIAM J. Comput. 29(6), 2074–2097 (2000)
Zwick, U.: Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 201–210 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Austrin, P., O’Donnell, R., Wright, J. (2012). A New Point of NP-Hardness for 2-to-1 Label Cover. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2012 2012. Lecture Notes in Computer Science, vol 7408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32512-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-32512-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32511-3
Online ISBN: 978-3-642-32512-0
eBook Packages: Computer ScienceComputer Science (R0)