A new point of NP-hardness for 2-to-1 Label Cover
Per Austrin, Ryan O'Donnell, John Wright
TL;DR
This paper proves a new NP-hardness result for the 2-to-1 Label Cover problem, showing it remains hard to approximate within a certain ratio even when instances are satisfiable.
Contribution
It establishes a novel NP-hardness threshold for approximating satisfiable 2-to-1 Label Cover instances, advancing understanding of its computational complexity.
Findings
Proves NP-hardness of approximating 2-to-1 Label Cover within (23/24 + ε)
Shows hardness persists even for satisfiable instances
Contributes to complexity theory of label cover problems
Abstract
We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a -satisfying assignment.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Computational Geometry and Mesh Generation · Advanced Graph Theory Research