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

Joint Winner性质中的离散凸性

Discrete Convexity in Joint Winner Property

Yuni Iwamasa, Kazuo Murota, Stanislav Zivny

摘要:

本文揭示了数值约束满足问题(VCSPs)中的联合优胜者性质(JWP)与离散凸分析(DCA)中的M ${}^\natural$ -凸性之间的关系.我们引入了M-${}^\natural$ -凸完备化问题,并证明了满足JWP的函数$f$是Z-自由的当且仅当与$f$相关联的某个函数$\overline{f}$是M-${}^\natural$ -凸完备化的.这意味着如果一个函数是Z自由的,那么该函数可以通过M ${}^\natural$ -凸相交算法在多项式时间内最小化。此外,我们提出了一个新的算法Z-自由函数的最小化,这是比以前的算法的一些参数值更快。

英文摘要:

In this paper, we reveal a relation between joint winner property (JWP) in the field of valued constraint satisfaction problems (VCSPs) and M${}^\natural$-convexity in the field of discrete convex analysis (DCA). We introduce the M${}^\natural$-convex completion problem, and show that a function $f$ satisfying the JWP is Z-free if and only if a certain function $\overline{f}$ associated with $f$ is M${}^\natural$-convex completable. This means that if a function is Z-free, then the function can be minimized in polynomial time via M${}^\natural$-convex intersection algorithms. Furthermore we propose a new algorithm for Z-free function minimization, which is faster than previous algorithms for some parameter values.

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

↑