树上最短增广路径的紧界
A Tight Bound for Shortest Augmenting Paths on Trees
摘要:
最短增广路径技术是最大匹配和最大流算法的基本思想之一。自Edmonds和Karp于1972年提出以来,它已被广泛应用于许多不同的环境。令人惊讶的是,尽管这种广泛的使用,它仍然没有得到很好的理解,即使在最简单的情况下:在树上的在线二分匹配问题。在这个问题中,一个二分树$T=(W \uplus B, E)$被在线显示,即,在每一轮中,来自$B$具有其关联边的一个顶点到达。它是由Chaudhuri et.等[K.乔杜里角达斯卡拉基斯河D. Kleinberg和H.是林书带增广的在线二分完美匹配。在INFOCOM 2009]中,找到的所有最短扩增路径的总长度为$O(n \log n)$。本文证明了树在$O(n \log^2 n)$界上的最短扩充路的总长度的一个紧$O(n \log n)$上界[B. Bosek,D. Leniowski,P. Sankowski,and A. Zych。树上在线匹配的最短增广路径。WAOA 2015]。
英文摘要:
The shortest augmenting path technique is one of the fundamental ideas used in maximum matching and maximum flow algorithms. Since being introduced by Edmonds and Karp in 1972, it has been widely applied in many different settings. Surprisingly, despite this extensive usage, it is still not well understood even in the simplest case: online bipartite matching problem on trees. In this problem a bipartite tree $T=(W \uplus B, E)$ is being revealed online, i.e., in each round one vertex from $B$ with its incident edges arrives. It was conjectured by Chaudhuri et. al. [K. Chaudhuri, C. Daskalakis, R. D. Kleinberg, and H. Lin. Online bipartite perfect matching with augmentations. In INFOCOM 2009] that the total length of all shortest augmenting paths found is $O(n \log n)$. In this paper, we prove a tight $O(n \log n)$ upper bound for the total length of shortest augmenting paths for trees improving over $O(n \log^2 n)$ bound [B. Bosek, D. Leniowski, P. Sankowski, and A. Zych. Shortest augmenting paths for online matchings on trees. In WAOA 2015].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。