Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank

01/02/2023
by   Dror Chawin, et al.
0

The orthogonality dimension of a graph G over ℝ is the smallest integer k for which one can assign a nonzero k-dimensional real vector to each vertex of G, such that every two adjacent vertices receive orthogonal vectors. We prove that for every sufficiently large integer k, it is 𝖭𝖯-hard to decide whether the orthogonality dimension of a given graph over ℝ is at most k or at least 2^(1-o(1)) · k/2. We further prove such hardness results for the orthogonality dimension over finite fields as well as for the closely related minrank parameter, which is motivated by the index coding problem in information theory. This in particular implies that it is 𝖭𝖯-hard to approximate these graph quantities to within any constant factor. Previously, the hardness of approximation was known to hold either assuming certain variants of the Unique Games Conjecture or for approximation factors smaller than 3/2. The proofs involve the concept of line digraphs and bounds on their orthogonality dimension and on the minrank of their complement.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2020

The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications

The orthogonality dimension of a graph G=(V,E) over a field 𝔽 is the sma...
research
07/12/2019

The Projection Games Conjecture and the Hardness of Approximation of SSAT and related problems

The Super-SAT or SSAT problem was introduced by Dinur, Kindler, Raz and ...
research
06/12/2019

Approximating the Orthogonality Dimension of Graphs and Hypergraphs

A t-dimensional orthogonal representation of a hypergraph is an assignme...
research
01/12/2023

Hardness of Ruling Out Short Proofs of Kolmogorov Randomness

A meta-complexity assumption, Feasible Chaitin Incompleteness (FCI), ass...
research
10/02/2021

Local Orthogonality Dimension

An orthogonal representation of a graph G over a field 𝔽 is an assignmen...
research
01/23/2023

Improved Hardness of Approximation for Geometric Bin Packing

The Geometric Bin Packing (GBP) problem is a generalization of Bin Packi...
research
08/17/2020

W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension

In the k-Center problem, we are given a graph G=(V,E) with positive edge...

Please sign up or login with your details

Forgot password? Click here to reset