arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.07418cs.DS
收藏

最优一般匹配

Optimal General Matchings

Szymon Dudycz, Katarzyna Paluch

摘要:

给定一个图$G=(V,E)$和对于每个顶点$v \in V$的集合$\{0,1,\ldots, d_G(v)\}$的子集$B(v)$,$B$ -匹配$G$是任何集合$F \subseteq E$,使得对于每个顶点$v$有$d_F(v) \in B(v)$。一般的匹配问题要求在给定的图中存在$B$ -匹配.如果存在一个数$k \in B(v)$使得$k+1, \ldots, k+p \notin B(v)$和$k+p+1 \in B(v)$,则集合$B(v)$被称为具有{ \em长度间隙} $p$。在没有任何限制的情况下,一般的匹配问题是NP完全的。然而,如果没有一个集合$B(v)$包含长度大于$1$的间隙,则可以在多项式时间内解决该问题,并且Cornuejols \cite{Cor}提出了一种用于找到$B$匹配(如果存在)的算法。在本文中,我们考虑一个版本的一般匹配问题,在其中,我们有兴趣找到一个$B$匹配有最大(或最小)的边缘数。我们提出了第一个多项式时间算法的最大权重$B$匹配的情况下,没有一组$B(v)$包含一个间隙的长度大于$1$。

英文摘要:

Given a graph $G=(V,E)$ and for each vertex $v \in V$ a subset $B(v)$ of the set $\{0,1,\ldots, d_G(v)\}$ a $B$-matching of $G$ is any set $F \subseteq E$ such that $d_F(v) \in B(v)$ for each vertex $v$. The general matching problem asks the existence of a $B$-matching in a given graph. A set $B(v)$ is said to have a {\em gap of length} $p$ if there exists a number $k \in B(v)$ such that $k+1, \ldots, k+p \notin B(v)$ and $k+p+1 \in B(v)$. Without any restrictions the general matching problem is NP-complete. However, if no set $B(v)$ contains a gap of length greater than $1$, then the problem can be solved in polynomial time and Cornuejols \cite{Cor} presented an algorithm for finding a $B$-matching, if it exists. In this paper we consider a version of the general matching problem, in which we are interested in finding a $B$-matching having a maximum (or minimum) number of edges. We present the first polynomial time algorithm for the maximum weight $B$-matching for the case when no set $B(v)$ contains a gap of length greater than $1$.

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

↑