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 21-approximation algorithm for this class of problems.
@article{arxiv.1803.05718,
title = {Approximating Max-Cut under Graph-MSO Constraints},
author = {Martin Koutecký and Jon Lee and Viswanath Nagarajan and Xiangkun Shen},
journal= {arXiv preprint arXiv:1803.05718},
year = {2018}
}
Comments
arXiv admin note: text overlap with arXiv:1511.08152