English

A new point of NP-hardness for 2-to-1 Label Cover

Computational Complexity 2012-04-26 v1
Authors: Per Austrin , Ryan O'Donnell , John Wright
View on arXiv ↗ PDF ↗

Abstract

We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a (23/24+\eps)(23/24 + \eps)-satisfying assignment.

Keywords

np-hardness 2-to-1 label cover approximation algorithms constraint satisfaction problems computational complexity hardness of approximation

Cite

@article{arxiv.1204.5666,
  title  = {A new point of NP-hardness for 2-to-1 Label Cover},
  author = {Per Austrin and Ryan O'Donnell and John Wright},
  journal= {arXiv preprint arXiv:1204.5666},
  year   = {2012}
}

Related papers

View all related →
Computational Complexity · Computer Science
New NP-hardness results for 3-Coloring and 2-to-1 Label Cover
Per Austrin, Ryan O'Donnell, Li-Yang Tan, John Wright
2012-10-30
Combinatorics · Mathematics
The Complexity of Pebbling and Cover Pebbling
Nathaniel G. Watson
2007-05-23
Discrete Mathematics · Computer Science
Computational complexity of distance edge labeling
Dušan Knop, Tomáš Masařík
2022-03-17
Computational Complexity · Computer Science
$2^{(\log N)^{1/10-o(1)}}$ Hardness for Hypergraph Coloring
Sangxia Huang
2015-10-15
Computational Complexity · Computer Science
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
Per Austrin, Rajsekar Manokaran, Cenny Wenner
2013-07-22
Discrete Mathematics · Computer Science
The complexity of promise SAT on non-Boolean domains
Alex Brandts, Marcin Wrochna, Stanislav Živný
2021-09-10
Computational Complexity · Computer Science
On the Complexity of Minimum Labeling Alignment of Two Genomes
Riccardo Dondi, Nadia El-Mabrouk
2012-06-12
Computational Complexity · Computer Science
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
2014-04-01
Computational Complexity · Computer Science
Restrictive Acceptance Suffices for Equivalence Problems
Bernd Borchert, Lane A. Hemaspaandra, Joerg Rothe
2007-05-23
Data Structures and Algorithms · Computer Science
Weighted Upper Edge Cover: Complexity and Approximability
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jerome Monnot, Florian Sikora
2018-11-08
Computational Complexity · Computer Science
The Complexity of Planar Counting Problems
Harry B. Hunt, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard E. Stearns
2007-05-23
Geometric Topology · Mathematics
Embeddability in $\mathbb{R}^3$ is NP-hard
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
2018-08-23
Computational Complexity · Computer Science
Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics
Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Alexandru I. Tomescu +1
2018-05-23
Combinatorics · Mathematics
An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
Vahan Mkrtchyan
2025-10-15
Data Structures and Algorithms · Computer Science
On the complexity of the upgrading version of the maximal covering location problem
Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía
2024-09-19
Computational Complexity · Computer Science
No Small Linear Program Approximates Vertex Cover within a Factor $2 - \epsilon$
Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson
2015-11-30
Computational Complexity · Computer Science
A Characterization of hard-to-cover CSPs
Amey Bhangale, Prahladh Harsha, Girish Varma
2021-01-05
Computational Complexity · Computer Science
$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing
Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi
2011-09-13
Optimization and Control · Mathematics
A $4/3\cdot OPT+2/3$ approximation for big two-bar charts packing problem
Adil Erzin, Alexander Kononov, Georgii Melidi, Stepan Nazarenko
2022-12-05
Data Structures and Algorithms · Computer Science
Label Cover instances with large girth and the hardness of approximating basic k-spanner
Michael Dinitz, Guy Kortsarz, Ran Raz
2012-03-06
Discrete Mathematics · Computer Science
Algorithmic complexity of proper labeling problems
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
2017-01-25
Computational Geometry · Computer Science
Link Crossing Number is NP-hard
Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
2019-08-13
Computational Complexity · Computer Science
Hardness of Learning Boolean Functions from Label Proportions
Venkatesan Guruswami, Rishi Saket
2024-03-29
Discrete Mathematics · Computer Science
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl +1
2025-02-28
Data Structures and Algorithms · Computer Science
On the approximability of the vertex cover and related problems
Qiaoming Han, Abraham P. Punnen
2007-12-21