A μ-constrained Boolean MAX-CSP (ψ) instance is a Boolean Max-CSP instance on
predicate ψ:{0,1\}^r→{0,1\} where the objective is to find a labeling of relative weight exactly …

For any $\varepsilon> 0$, we prove that $ k $-Dimensional Matching is hard to approximate
within a factor of $ k/(12+\varepsilon) $ for large $ k $ unless $\textsf {NP}\subseteq\textsf …

We study polynomial-time approximation algorithms for edge and vertex Sparsest Cut and
Small Set Expansion in terms of k, the number of edges or vertices cut in the optimal …

The vertex expansion of graph is a fundamental graph parameter. Given a graph G=(V, E)
and a parameter δ∈(0, 1/2], its δ-SSVE is defined as where∂ V (S) is the vertex boundary of …

This thesis studies how the approximability of some fundamental computational problems is
affected by some additional requirements on the structure of the inputs. The problems …

The p-biased Homogeneous r-Lin problem (Hom-r-Lin_p) is the following: given a
homogeneous system of r-variable equations over m {F} ₂, the goal is to find an assignment …

Abstract Maximum Constraint satisfaction problems (Max-CSPs) are ubiquitous in computer
science and encompass optimization problems such as Max-CUT, Max-DICUT, Max-kSAT …