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

半匹配问题的快速算法

Faster Algorithms for Semi-Matching Problems

Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai

摘要:

我们考虑的问题,发现\textit{semi-matching}在二分图,这也是广泛研究的各种名称在调度文献。我们给更快的算法加权和未加权的情况下。对于加权情形,我们利用问题的几何结构给出了一个$O(nm\log n)$时间算法,其中$n$是顶点数,$m$是边数.这改进了Horn [Operations Research 1973]和Bruno、Coffman和Sethi [Communications of the ACM 1974]的经典$O(n^3)$算法。对于未加权的情况,界限可以进一步改进。我们给出了一个简单的分治算法,运行在$O(\sqrt{n}m\log n)$时间,改进了两个以前的$O(nm)$时间算法亚伯拉罕[硕士论文,格拉斯哥大学2003年]和哈维,Ladner,Lovász和塔米尔[WADS 2003年和算法杂志2006年]。我们还扩展了该算法,以在$O(\sqrt{n}m\log n)$时间内解决\textit{Balance Edge Cover}问题,改进了Harada、Ono、Sadakane和Yamashita [ISAAC 2008]先前的$O(nm)$时间算法。

英文摘要:

We consider the problem of finding \textit{semi-matching} in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms for both weighted and unweighted case. For the weighted case, we give an $O(nm\log n)$-time algorithm, where $n$ is the number of vertices and $m$ is the number of edges, by exploiting the geometric structure of the problem. This improves the classical $O(n^3)$ algorithms by Horn [Operations Research 1973] and Bruno, Coffman and Sethi [Communications of the ACM 1974]. For the unweighted case, the bound could be improved even further. We give a simple divide-and-conquer algorithm which runs in $O(\sqrt{n}m\log n)$ time, improving two previous $O(nm)$-time algorithms by Abraham [MSc thesis, University of Glasgow 2003] and Harvey, Ladner, Lovász and Tamir [WADS 2003 and Journal of Algorithms 2006]. We also extend this algorithm to solve the \textit{Balance Edge Cover} problem in $O(\sqrt{n}m\log n)$ time, improving the previous $O(nm)$-time algorithm by Harada, Ono, Sadakane and Yamashita [ISAAC 2008].

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

↑