arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.04037math.OCcs.DS
收藏

计算$k$序列-基数分配

Computing the sequence of $k$-cardinality assignments

Amnon Rosenmann

摘要:

$k$ -基数分配问题要求在加权二部图$K_{n,n}$,$k \leq n$中找到基数匹配$k$的最大(最小)权. Gassner和Klinz在2010年提出的参数分配问题的算法在时间$O(n^3)$中计算了那些整数$k \leq n$的$k$ -基数分配的集合,这些整数指的是相应的最大多项式的“基本”项。我们在这里表明,可以扩展该算法和计算在第二阶段的其他“半必要”的条款在时间$O(n^2)$,这导致在整个序列的$k=1,...,n$ -基数分配的时间复杂度$O(n^3)$。在第二阶段要计算的分配越多,两阶段算法运行得越快。然而,通常,这种两阶段算法对现有算法没有益处,例如,基于连续最短路径算法的更简单的网络流算法,其也计算所有的$k$ -在时间上的基数分配$O(n^3)$。

英文摘要:

The $k$-cardinality assignment problem asks for finding a maximal (minimal) weight of a matching of cardinality $k$ in a weighted bipartite graph $K_{n,n}$, $k \leq n$. The algorithm of Gassner and Klinz from 2010 for the parametric assignment problem computes in time $O(n^3)$ the set of $k$-cardinality assignments for those integers $k \leq n$ which refer to "essential" terms of a corresponding maxpolynomial. We show here that one can extend this algorithm and compute in a second stage the other "semi-essential" terms in time $O(n^2)$, which results in a time complexity of $O(n^3)$ for the whole sequence of $k=1,...,n$-cardinality assignments. The more there are assignments left to be computed at the second stage the faster the two-stage algorithm runs. In general, however, there is no benefit for this two-stage algorithm on the existing algorithms, e.g. the simpler network flow algorithm based on the successive shortest path algorithm which also computes all the $k$-cardinality assignments in time $O(n^3)$.

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

↑