196 research outputs found
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
Proving Weak Approximability Without Algorithms
A boolean predicate is said to be strongly approximation resistant if, given a near-satisfiable instance of its maximum constraint satisfaction problem, it is hard to find an assignment such that the fraction of constraints satisfied deviates significantly from the expected fraction of constraints satisfied by a random assignment. A predicate which is not strongly approximation resistant is known as weakly approximable.
We give a new method for proving the weak approximability of predicates, using a simple SDP relaxation, without designing and analyzing new rounding algorithms for each predicate. Instead, we use the recent characterization of strong approximation resistance by Khot et al. [STOC 2014], and show how to prove that for a given predicate, certain necessary conditions for strong resistance derived from their characterization, are violated. By their result, this implies the existence of a good rounding algorithm, proving weak approximability.
We show how this method can be used to obtain simple proofs of (weak approximability analogues of) various known results on approximability, as well as new results on weak approximability of symmetric predicates
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
A k-uniform hypergraph is said to be r-rainbow colorable if there is an r-coloring of its vertices such that every hyperedge intersects all r color classes. Given as input such a hypergraph, finding a r-rainbow coloring of it is NP-hard for all k >= 3 and r >= 2. Therefore, one settles for finding a rainbow coloring with fewer colors (which is an easier task). When r=k (the maximum possible value), i.e., the hypergraph is k-partite, one can efficiently 2-rainbow color the hypergraph, i.e., 2-color its vertices so that there are no monochromatic edges. In this work we consider the next smaller value of r=k-1, and prove that in this case it is NP-hard to rainbow color the hypergraph with q := ceil[(k-2)/2] colors. In particular, for k <=6, it is NP-hard to 2-color (k-1)-rainbow colorable k-uniform hypergraphs.
Our proof follows the algebraic approach to promise constraint satisfaction problems. It proceeds by characterizing the polymorphisms associated with the approximate rainbow coloring problem, which are rainbow colorings of some product hypergraphs on vertex set [r]^n. We prove that any such polymorphism f: [r]^n -> [q] must be C-fixing, i.e., there is a small subset S of C coordinates and a setting a in [q]^S such that fixing x_{|S} = a determines the value of f(x). The key step in our proof is bounding the sensitivity of certain rainbow colorings, thereby arguing that they must be juntas. Armed with the C-fixing characterization, our NP-hardness is obtained via a reduction from smooth Label Cover
On streaming approximation algorithms for constraint satisfaction problems
In this thesis, we explore streaming algorithms for approximating constraint
satisfaction problems (CSPs). The setup is roughly the following: A computer
has limited memory space, sees a long "stream" of local constraints on a set of
variables, and tries to estimate how many of the constraints may be
simultaneously satisfied. The past ten years have seen a number of works in
this area, and this thesis includes both expository material and novel
contributions. Throughout, we emphasize connections to the broader theories of
CSPs, approximability, and streaming models, and highlight interesting open
problems.
The first part of our thesis is expository: We present aspects of previous
works that completely characterize the approximability of specific CSPs like
Max-Cut and Max-Dicut with -space streaming algorithm (on
-variable instances), while characterizing the approximability of all CSPs
in space in the special case of "composable" (i.e., sketching)
algorithms, and of a particular subclass of CSPs with linear-space streaming
algorithms.
In the second part of the thesis, we present two of our own joint works. We
begin with a work with Madhu Sudan and Santhoshini Velusamy in which we prove
linear-space streaming approximation-resistance for all ordering CSPs (OCSPs),
which are "CSP-like" problems maximizing over sets of permutations. Next, we
present joint work with Joanna Boyland, Michael Hwang, Tarun Prasad, and
Santhoshini Velusamy in which we investigate the -space streaming
approximability of symmetric Boolean CSPs with negations. We give explicit
-space sketching approximability ratios for several families of CSPs,
including Max-AND; develop simpler optimal sketching approximation
algorithms for threshold predicates; and show that previous lower bounds fail
to characterize the -space streaming approximability of Max-AND.Comment: Harvard College senior thesis; 119 pages plus references; abstract
shortened for arXiv; formatted with Dissertate template (feel free to copy!);
exposits papers arXiv:2105.01782 (APPROX 2021) and arXiv:2112.06319 (APPROX
2022
Phylogenetic CSPs are Approximation Resistant
We study the approximability of a broad class of computational problems --
originally motivated in evolutionary biology and phylogenetic reconstruction --
concerning the aggregation of potentially inconsistent (local) information
about items of interest, and we present optimal hardness of approximation
results under the Unique Games Conjecture. The class of problems studied here
can be described as Constraint Satisfaction Problems (CSPs) over infinite
domains, where instead of values or a fixed-size domain, the
variables can be mapped to any of the leaves of a phylogenetic tree. The
topology of the tree then determines whether a given constraint on the
variables is satisfied or not, and the resulting CSPs are called Phylogenetic
CSPs. Prominent examples of Phylogenetic CSPs with a long history and
applications in various disciplines include: Triplet Reconstruction, Quartet
Reconstruction, Subtree Aggregation (Forbidden or Desired). For example, in
Triplet Reconstruction, we are given triplets of the form
(indicating that ``items are more similar to each other than to '')
and we want to construct a hierarchical clustering on the items, that
respects the constraints as much as possible. Despite more than four decades of
research, the basic question of maximizing the number of satisfied constraints
is not well-understood. The current best approximation is achieved by
outputting a random tree (for triplets, this achieves a 1/3 approximation). Our
main result is that every Phylogenetic CSP is approximation resistant, i.e.,
there is no polynomial-time algorithm that does asymptotically better than a
(biased) random assignment. This is a generalization of the results in
Guruswami, Hastad, Manokaran, Raghavendra, and Charikar (2011), who showed that
ordering CSPs are approximation resistant (e.g., Max Acyclic Subgraph,
Betweenness).Comment: 45 pages, 11 figures, Abstract shortened for arxi
Robust algorithms with polynomial loss for near-unanimity CSPs
An instance of the Constraint Satisfaction Problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a xed domain to the variables so that all constraints are satised. In the optimization version, the goal is to maximize the number of satised constraints. An approximation algorithm for CSP is called robust if it outputs an assignment satisfying an (1????g("))-fraction of constraints on any (1????")-satisable instance, where the loss function g is such that g(") ! 0 as " ! 0. We study how the robust approximability of CSPs depends on the set of constraint relations allowed in instances, the so-called constraint language. All constraint languages admitting a robust polynomial-time algorithm (with some g) have been characterised by Barto and Kozik, with the general bound on the loss g being doubly exponential, specically g(") = O((log log(1="))= log(1=")). It is natural to ask when a better loss can be achieved: in particular, polynomial loss g(") = O("1=k) for some constant k. In this paper, we consider CSPs with a constraint language having a nearunanimity polymorphism. This general condition almost matches a known necessary condition for having a robust algorithm with polynomial loss. We give two randomized robust algorithms with polynomial loss for such CSPs: one works for any near-unanimity polymorphism and the parameter k in the loss depends on the size of the domain and the arity of the relations in ????, while the other works for a special ternary near-unanimity operation called dual discriminator with k = 2 for any domain size. In the latter case, the CSP is a common generalisation of Unique Games with a xed domain and 2-Sat. In the former case, we use the algebraic approach to the CSP. Both cases use the standard semidenite programming relaxation for CSP
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
We study the complexity of estimating the optimum value of a Boolean 2CSP (arity two constraint satisfaction problem) in the single-pass streaming setting, where the algorithm is presented the constraints in an arbitrary order. We give a streaming algorithm to estimate the optimum within a factor approaching 2/5 using logarithmic space, with high probability. This beats the trivial factor 1/4 estimate obtained by simply outputting 1/4-th of the total number of constraints.
The inspiration for our work is a lower bound of Kapralov, Khanna, and Sudan (SODA\u2715) who showed that a similar trivial estimate (of factor 1/2) is the best one can do for Max CUT. This lower bound implies that beating a factor 1/2 for Max DICUT (a special case of Max 2CSP), in particular, to distinguish between the case when the optimum is m/2 versus when it is at most (1/4+eps)m, where m is the total number of edges, requires polynomial space. We complement this hardness result by showing that for DICUT, one can distinguish between the case in which the optimum exceeds (1/2+eps)m and the case in which it is close to m/4.
We also prove that estimating the size of the maximum acyclic subgraph of a directed graph, when its edges are presented in a single-pass stream, within a factor better than 7/8 requires polynomial space
- …