Approximating Max-Cut under Graph-MSO Constraints
نویسندگان
چکیده
We consider the max-cut and max-k-cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of constant treewidth. We give a 1 2 -approximation algorithm for this class of problems.
منابع مشابه
Approximating CSPs with global cardinality constraints using SDP hierarchies
This work is concerned with approximating constraint satisfaction problems (CSPs) with an additional global cardinality constraints. For example, Max Cut is a boolean CSP where the input is a graph G = (V, E) and the goal is to find a cut S ∪ S̄ = V that maximizes the number of crossing edges, |E(S , S̄ )|. The Max Bisection problem is a variant of Max Cut with an additional global constraint tha...
متن کاملApproximating Unique Games Using Low Diameter Graph Decomposition
We design approximation algorithms for Unique Games when the constraint graph admits good low diameter graph decomposition. For the Max-2Link problem in Kr-minor free graphs, when there is an assignment satisfying 1 − ε fraction of constraints, we present an algorithm that produces an assignment satisfying 1−O(rε) fraction of constraints, with the approximation ratio independent of the alphabet...
متن کاملSub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse
It has long been known, since the classical work of (Arora, Karger, Karpinski, JCSS 99), that Max-CUT admits a PTAS on dense graphs, and more generally, Max-k-CSP admits a PTAS on “dense” instances with Ω(n) constraints. In this paper we extend and generalize their exhaustive sampling approach, presenting a framework for (1−ε)-approximating any Max-k-CSP problem in sub-exponential time while si...
متن کاملMax-Cut Under Graph Constraints
An instance of the graph-constrained max-cut (GCMC) problem consists of (i) an undirected graph G = (V,E) and (ii) edge-weights c : ( V 2 ) → R+ on a complete undirected graph. The objective is to find a subset S ⊆ V of vertices satisfying some graph-based constraint in G that maximizes the weight ∑ u∈S,v 6∈S cuv of edges in the cut (S, V \ S). The types of graph constraints we can handle inclu...
متن کامل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 e...
متن کامل