Approximating Max-Cut under Graph-MSO Constraints.

Martin Koutecký,Jon Lee,Viswanath Nagarajan,Xiangkun Shen

Operations Research Letters（2018）

引用 0|浏览40

暂无评分

摘要

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 12-approximation algorithm for this class of problems.

查看译文

关键词

Max cut,Approximation algorithm,Monadic second-order logic,Treewidth,Dynamic program

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要