Approximating Max-Cut under Graph-MSO Constraints
share
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.
READ FULL TEXT