arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1104.2818cs.DMcs.CCcs.DS
收藏

3-可满足MaxSat的一个新界及其数学应用

A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application

Gregory Gutin, Mark Jones, Dominik Scheder, Anders Yeo

摘要:

设F是具有n个变量和m个子句的CNF公式. F是3-可满足的,如果对于F中的任意3个子句,存在一个满足所有子句的真值赋值。Lieberherr和Specker(1982)以及后来的Yannakakis(1994)证明了在每个3-可满足的CNF公式中,至少有2/3的子句可以被真值赋值所满足。我们改进了这一结果,证明了每个3-可满足的CNF公式F包含一个变量U的子集,使得某个真值赋值$τ$至少满足$2m/3+ m_U/3+ρn'$子句,其中m是F的子句数,m_U是F中包含来自U的变量的子句数,n'是不包含U中变量的子句中变量的总数,ρ是一个正的绝对常数. U和$τ$都可以在多项式时间内找到。我们用我们的结果表明,下面的参数化问题是固定参数的易处理的,而且,有一个线性变量数的内核。在3-S-MAXSAT-AE中,我们给出了一个3-可满足的CNF公式F,它包含m个子句,并要求我们判断是否存在至少满足2 m/3 + k个子句的赋值,其中k是参数.

英文摘要:

Let F be a CNF formula with n variables and m clauses. F is 3-satisfiable if for any 3 clauses in F, there is a truth assignment which satisfies all of them. Lieberherr and Specker (1982) and, later, Yannakakis (1994) proved that in each 3-satisfiable CNF formula at least 2/3 of its clauses can be satisfied by a truth assignment. We improve this result by showing that every 3-satisfiable CNF formula F contains a subset of variables U, such that some truth assignment $τ$ will satisfy at least $2m/3+ m_U/3+ρn'$ clauses, where m is the number of clauses of F, m_U is the number of clauses of F containing a variable from U, n' is the total number of variables in clauses not containing a variable in U, and ρis a positive absolute constant. Both U and $τ$ can be found in polynomial time. We use our result to show that the following parameterized problem is fixed-parameter tractable and, moreover, has a kernel with a linear number of variables. In 3-S-MAXSAT-AE, we are given a 3-satisfiable CNF formula F with m clauses and asked to determine whether there is an assignment which satisfies at least 2m/3 + k clauses, where k is the parameter.

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

↑