DeepAI AI Chat
Log In Sign Up

Approximating Constraint Satisfaction Problems Symmetrically

08/03/2020
∙
by   Jamie Tucker-Foltz, et al.
∙
0
∙

This thesis investigates the extent to which the optimal value of a constraint satisfaction problem (CSP) can be approximated by some sentence of fixed point logic with counting (FPC). It is known that, assuming 𝖯≠𝖭𝖯 and the Unique Games Conjecture, the best polynomial time approximation algorithm for any CSP is given by solving and rounding a specific semidefinite programming relaxation. We prove an analogue of this result for algorithms that are definable as FPC-interpretations, which holds without the assumption that 𝖯≠𝖭𝖯. While we are not able to drop (an FPC-version of) the Unique Games Conjecture as an assumption, we do present some partial results toward proving it. Specifically, we give a novel construction which shows that, for all α > 0, there exists a positive integer q = poly(1/α) such that no there is no FPC-interpretation giving an α-approximation of Unique Games on a label set of size q.

READ FULL TEXT
∙ 04/09/2021

Inapproximability of Unique Games in Fixed-Point Logic with Counting

We study the extent to which it is possible to approximate the optimal v...
∙ 12/09/2018

Rounding semidefinite programs for large-domain problems via Brownian motion

We present a new simple method for rounding a semidefinite programming r...
∙ 09/22/2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments

A tournament is a directed graph T such that every pair of vertices is ...
∙ 02/21/2020

Temporal Constraint Satisfaction Problems in Fixed-Point Logic

Finite-domain constraint satisfaction problems are either solvable by Da...
∙ 04/29/2021

A 0.502·MaxCut Approximation using Quadratic Programming

We study the MaxCut problem for graphs G=(V,E). The problem is NP-hard, ...
∙ 12/24/2022

Phylogenetic CSPs are Approximation Resistant

We study the approximability of a broad class of computational problems ...
∙ 03/19/2018

Computational topology and the Unique Games Conjecture

Covering spaces of graphs have long been useful for studying expanders (...