skip to main content
research-article

New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover

Published:01 March 2014Publication History
Skip Abstract Section

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.

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. Per Austrin and Elchanan Mossel. 2009. Approximation resistant predicates from pairwise independence. Comput. Complex. 18, 2, 249--271. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. Irit Dinur, Elchanan Mossel, and Oded Regev. 2009. Conditional hardness for approximate coloring. SIAM J. Comput. 39, 3, 843--873. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Alan Frieze and Mark Jerrum. 1997. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18, 1, 67--81.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. Johan Håstad. 2001. Some optimal inapproximability results. J. ACM 48, 4, 798--859. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Russell Impagliazzo and Ramamohan Paturi. 2001. On the complexity of k-SAT. J. Comput. Syst. Sci. 62, 2, 367--375. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. Dana Moshkovitz and Ran Raz. 2010. Two-query PCP with subconstant error. J. ACM 57, 5, 29. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. Erez Petrank. 1994. The hardness of approximation: Gap location. Comput. Complex. 4, 2, 133--157. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle Scholar
  20. Luca Trevisan, Gregory Sorkin, Madhu Sudan, and David Williamson. 2000. Gadgets, approximation, and linear programming. SIAM J. Comput. 29, 6, 2074--2097. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Computation Theory
      ACM Transactions on Computation Theory  Volume 6, Issue 1
      March 2014
      92 pages
      ISSN:1942-3454
      EISSN:1942-3462
      DOI:10.1145/2600088
      Issue’s Table of Contents

      Copyright © 2014 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 March 2014
      • Accepted: 1 October 2013
      • Revised: 1 July 2013
      • Received: 1 January 2013
      Published in toct Volume 6, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed
    • Article Metrics

      • Downloads (Last 12 months)6
      • Downloads (Last 6 weeks)1

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!