11 research outputs found
Approximation Algorithms for CSPs
In this survey, we offer an overview of approximation algorithms for constraint satisfaction problems (CSPs) - we describe main results and discuss various techniques used for solving CSPs
From Weak to Strong LP Gaps for All CSPs
We study the approximability of constraint satisfaction problems (CSPs) by linear programming (LP) relaxations. We show that for every CSP, the approximation obtained by a basic LP relaxation, is no weaker than the approximation obtained using relaxations given by Omega(log(n)/log(log(n))) levels of the Sherali-Adams hierarchy on instances of size n.
It was proved by Chan et al. [FOCS 2013] (and recently strengthened by Kothari et al. [STOC 2017]) that for CSPs, any polynomial size LP extended formulation is no stronger than relaxations obtained by a super-constant levels of the Sherali-Adams hierarchy. Combining this with our result also implies that any polynomial size LP extended formulation is no stronger than simply the basic LP, which can be thought of as the base level of the Sherali-Adams hierarchy. This essentially gives a dichotomy result for approximation of CSPs by polynomial size LP extended formulations.
Using our techniques, we also simplify and strengthen the result by Khot et al. [STOC 2014] on (strong) approximation resistance for LPs. They provided a necessary and sufficient condition under which Omega(loglog n) levels of the Sherali-Adams hierarchy cannot achieve an approximation better than a random assignment. We simplify their proof and strengthen the bound to Omega(log(n)/log(log(n))) levels
Towards a Characterization of Approximation Resistance for Symmetric CSPs
A Boolean constraint satisfaction problem (CSP) is called approximation resistant if independently setting variables to 1 with some probability achieves the best possible approximation ratio for the fraction of constraints satisfied. We study approximation resistance of a natural subclass of CSPs that we call Symmetric Constraint Satisfaction Problems (SCSPs), where satisfaction of each constraint only depends on the number of true literals in its scope. Thus a SCSP of arity k can be described by a subset of allowed number of true literals.
For SCSPs without negation, we conjecture that a simple sufficient condition to be approximation resistant by Austrin and Hastad is indeed necessary. We show that this condition has a compact analytic representation in the case of symmetric CSPs (depending only on the gap between the largest and smallest numbers in S), and provide the rationale behind our conjecture. We prove two interesting special cases of the conjecture, (i) when S is an interval and (ii) when S is even. For SCSPs with negation, we prove that the analogous sufficient condition by Austrin and Mossel is necessary for the same two cases, though we do not pose an analogous conjecture in general
SOS Lower Bounds with Hard Constraints: Think Global, Act Local
Many previous Sum-of-Squares (SOS) lower bounds for CSPs had two deficiencies related to global constraints. First, they were not able to support a "cardinality constraint", as in, say, the Min-Bisection problem. Second, while the pseudoexpectation of the objective function was shown to have some value beta, it did not necessarily actually "satisfy" the constraint "objective = beta". In this paper we show how to remedy both deficiencies in the case of random CSPs, by translating global constraints into local constraints. Using these ideas, we also show that degree-Omega(sqrt{n}) SOS does not provide a (4/3 - epsilon)-approximation for Min-Bisection, and degree-Omega(n) SOS does not provide a (11/12 + epsilon)-approximation for Max-Bisection or a (5/4 - epsilon)-approximation for Min-Bisection. No prior SOS lower bounds for these problems were known
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
On the Complexity of Winner Determination and Strategic Control in Conditional Approval Voting
We focus on a generalization of the classic Minisum approval voting rule,
introduced by Barrot and Lang (2016), and referred to as Conditional Minisum
(CMS), for multi-issue elections with preferential dependencies. Under this
rule, voters are allowed to declare dependencies between different issues, but
the price we have to pay for this higher level of expressiveness is that we end
up with a computationally hard rule. Motivated by this, we first focus on
finding special cases that admit efficient algorithms for CMS. Our main result
in this direction is that we identify the condition of bounded treewidth (of an
appropriate graph, emerging from the provided ballots) as the necessary and
sufficient condition for exact polynomial algorithms, under common complexity
assumptions. We then move to the design of approximation algorithms. For the
(still hard) case of binary issues, we identify natural restrictions on the
voters' ballots, under which we provide the first multiplicative approximation
algorithms for the problem. The restrictions involve upper bounds on the number
of dependencies an issue can have on the others and on the number of
alternatives per issue that a voter can approve. Finally, we also investigate
the complexity of problems related to the strategic control of conditional
approval elections by adding or deleting either voters or alternatives and we
show that in most variants of these problems, CMS is computationally resistant
against control. Overall, we conclude that CMS can be viewed as a solution that
achieves a satisfactory tradeoff between expressiveness and computational
efficiency, when we have a limited number of dependencies among issues, while
at the same time exhibiting sufficient resistance to control