arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0604080cs.DM
收藏

Max 2-Sat和Max 2- CSP快速算法的线性规划设计与分析

Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP

Alexander D. Scott, Gregory B. Sorkin

摘要:

类$(r,2)$ -CSP,或简称为Max 2-CSP,由每个子句最多有两个$r$值变量的约束满足问题组成。对于$n$变量和$m$二进制子句的实例,我们提出了一个$O(n r^{5+19m/100})$ -时间算法,这是最快的多项式空间算法的许多问题的类,包括最大切割。该方法还证明了树宽界$\tw(G) \leq (13/75+o(1))m$,这给出了一个更快的Max 2-CSP算法,使用指数空间:运行在时间$\Ostar{2^{(13/75+o(1))m}}$,这是最快的大多数问题在Max 2-CSP。参数化的$n$,而不是$m$,图形的平均度$d$,我们显示了一个简单的算法运行时间$\Ostar{2^{(1-\frac{2}{d+1})n}}$,已知的最快的多项式空间算法。结合在一篇配套论文中介绍的“多项式CSP”,这些算法还允许(在空间和时间上有额外的多项式因子开销)计数和采样,以及解决像Max Bisection这样的问题,这些问题逃脱了通常的CSP框架。线性规划是算法设计和分析的关键。

英文摘要:

The class $(r,2)$-CSP, or simply Max 2-CSP, consists of constraint satisfaction problems with at most two $r$-valued variables per clause. For instances with $n$ variables and $m$ binary clauses, we present an $O(n r^{5+19m/100})$-time algorithm which is the fastest polynomial-space algorithm for many problems in the class, including Max Cut. The method also proves a treewidth bound $\tw(G) \leq (13/75+o(1))m$, which gives a faster Max 2-CSP algorithm that uses exponential space: running in time $\Ostar{2^{(13/75+o(1))m}}$, this is fastest for most problems in Max 2-CSP. Parametrizing in terms of $n$ rather than $m$, for graphs of average degree $d$ we show a simple algorithm running time $\Ostar{2^{(1-\frac{2}{d+1})n}}$, the fastest polynomial-space algorithm known. In combination with ``Polynomial CSPs'' introduced in a companion paper, these algorithms also allow (with an additional polynomial-factor overhead in space and time) counting and sampling, and the solution of problems like Max Bisection that escape the usual CSP framework. Linear programming is key to the design as well as the analysis of the algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑