Voting algorithms for unique games on complete graphs

10/22/2021
by   Antoine Méot, et al.
0

An approximation algorithm for a Constraint Satisfaction Problem is called robust if it outputs an assignment satisfying a (1 - f(ϵ))-fraction of the constraints on any (1-ϵ)-satisfiable instance, where the loss function f is such that f(ϵ) → 0 as ϵ→ 0. Moreover, the runtime of the algorithm should not depend in any way on ϵ. In this paper, we present such an algorithm for Min-Unique-Games(q) on complete graphs with q labels. Specifically, the loss function is f(ϵ) = (ϵ + c_ϵϵ^2), where c_ϵ is a constant depending on ϵ such that lim_ϵ→ 0 c_ϵ = 16. The runtime of our algorithm is O(qn^3) (with no dependence on ϵ) and can run in time O(qn^2) using a randomized implementation with a slightly larger constant c_ϵ. Our algorithm is combinatorial and uses voting to find an assignment. We prove NP-hardness (using a randomized reduction) for Min-Unique-Games(q) on complete graphs even in the case where the constraints form a cyclic permutation, which is also known as Min-Linear-Equations-mod-q on complete graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2020

Approximation Algorithms and Hardness for Strong Unique Games

The UNIQUE GAMES problem is a central problem in algorithms and complexi...
research
06/17/2020

Playing Unique Games on Certified Small-Set Expanders

We give an algorithm for solving unique games (UG) instances whose const...
research
09/06/2020

Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups

A seminal result of Håstad [J. ACM, 48(4):798–859, 2001] shows that it i...
research
03/29/2022

Firefighter Problem with Minimum Budget: Hardness and Approximation Algorithm for Unit Disk Graphs

Unit disk graphs are the set of graphs which represent the intersection ...
research
01/30/2023

Fast Combinatorial Algorithms for Min Max Correlation Clustering

We introduce fast algorithms for correlation clustering with respect to ...
research
05/01/2018

Spectrally Robust Graph Isomorphism

We initiate the study of spectral generalizations of the graph isomorphi...
research
08/01/2018

List Decoding with Double Samplers

We develop the notion of "double samplers", first introduced by Dinur an...

Please sign up or login with your details

Forgot password? Click here to reset