arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.05404cs.DScs.CCcs.GT
收藏

论树宽与稳定婚姻

On Treewidth and Stable Marriage

Sushmita Gupta, Saket Saurabh, Meirav Zehavi

摘要:

稳定婚姻是计算机科学和经济学的基本问题。这个问题的四个著名的NP-难优化版本是性别平等稳定婚姻(SESM),平衡稳定婚姻(BSM),最大稳定婚姻与领带(max-SMT)和最小稳定婚姻与领带(min-SMT)问题。本文从参数化复杂性的角度对这些问题进行了分析。我们进行这些问题的第一次研究的参数树宽。首先,我们研究了原始图的树宽$\mathtt{tw}$。我们证明了这四个问题都是W[1]-困难的。特别是,虽然很容易表明,所有四个问题承认算法,运行时间$n^{O(\mathtt{tw})}$,我们证明,所有这些算法很可能是本质上最优的。其次,我们研究了旋转有向图的树宽$\mathtt{tw}$。在此上下文中,未定义max-SMT和min-SMT。对于SESM和BSM,我们设计了在时间上运行的(非平凡的)算法$2^{\mathtt{tw}}n^{O(1)}$。然后,对于SESM和BSM,我们还证明,除非SETH是假的,算法运行在时间$(2-ε)^{\mathtt{tw}}n^{O(1)}$不存在任何固定的$ε>0$。因此,我们提出了一个全面的,完整的图片的稳定婚姻的中央优化版本的行为相对于树宽。

英文摘要:

Stable Marriage is a fundamental problem to both computer science and economics. Four well-known NP-hard optimization versions of this problem are the Sex-Equal Stable Marriage (SESM), Balanced Stable Marriage (BSM), max-Stable Marriage with Ties (max-SMT) and min-Stable Marriage with Ties (min-SMT) problems. In this paper, we analyze these problems from the viewpoint of Parameterized Complexity. We conduct the first study of these problems with respect to the parameter treewidth. First, we study the treewidth $\mathtt{tw}$ of the primal graph. We establish that all four problems are W[1]-hard. In particular, while it is easy to show that all four problems admit algorithms that run in time $n^{O(\mathtt{tw})}$, we prove that all of these algorithms are likely to be essentially optimal. Next, we study the treewidth $\mathtt{tw}$ of the rotation digraph. In this context, the max-SMT and min-SMT are not defined. For both SESM and BSM, we design (non-trivial) algorithms that run in time $2^{\mathtt{tw}}n^{O(1)}$. Then, for both SESM and BSM, we also prove that unless SETH is false, algorithms that run in time $(2-ε)^{\mathtt{tw}}n^{O(1)}$ do not exist for any fixed $ε>0$. We thus present a comprehensive, complete picture of the behavior of central optimization versions of Stable Marriage with respect to treewidth.

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

↑