Approximating Max-Cut under Graph-MSO Constraints

03/15/2018

∙

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

Approximating Max-Cut under Graph-MSO Constraints

Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm

Separating MAX 2-AND, MAX DI-CUT and MAX CUT

Max-Cut via Kuramoto-type Oscillators

Smoothed complexity of local Max-Cut and binary Max-CSP

Experimental performance of graph neural networks on random instances of max-cut

Fault Tolerant Max-Cut

A Classical Algorithm Which Also Beats 1/2+2/π1/√(D) For High Girth MAX-CUT

Approximating Max-Cut under Graph-MSO Constraints

Related Research

Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm

Separating MAX 2-AND, MAX DI-CUT and MAX CUT

Max-Cut via Kuramoto-type Oscillators

Smoothed complexity of local Max-Cut and binary Max-CSP

Experimental performance of graph neural networks on random instances of max-cut

Fault Tolerant Max-Cut

A Classical Algorithm Which Also Beats 1/2+2/π1/√(D) For High Girth MAX-CUT