On Regularity of Max-CSPs and Min-CSPs

04/17/2020
by   Aleksa Stankovic, et al.
0

We study approximability of regular constraint satisfaction problems, i.e., CSPs where each variable in an instance has the same number of occurrences. In particular, we show that for any CSP Λ, existence of an α approximation algorithm for unweighted regular Max-CSP Λ implies existence of an α-o(1) approximation algorithm for weighted Max-CSP Λ in which regularity of the instances is not imposed. We also give an analogous result for Min-CSPs, and therefore show that up to arbitrarily small error it is sufficient to conduct the study of approximability of CSPs only on regular unweighted instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2018

Approximating some network problems with scenarios

In this paper the shortest path and the minimum spanning tree problems i...
research
07/15/2022

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width

For any ε > 0, we give a polynomial-time n^ε-approximation algorithm for...
research
09/22/2020

On the Mysteries of MAX NAE-SAT

MAX NAE-SAT is a natural optimization problem, closely related to its be...
research
09/09/2021

Parameterized inapproximability of Morse matching

We study the problem of minimizing the number of critical simplices from...
research
07/17/2020

A Hölderian backtracking method for min-max and min-min problems

We present a new algorithm to solve min-max or min-min problems out of t...
research
11/17/2020

Efficient stream-based Max-Min diversification with minimal failure rate

The stream-based Max-Min diversification problem concerns the task of se...
research
04/07/2021

A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence

We propose a novel construction for the well-known prefer-max De Bruijn ...

Please sign up or login with your details

Forgot password? Click here to reset