Approximating Semi-matchings in Streaming and in Two-Party Communication
ACM Trans. Algorithms(2013)
摘要
We study the communication complexity and streaming complexity of approximating unweighted semi-matchings. A semi-matching in a bipartite graph G = (A, B, E), with n = |A|, is a subset of edges S ⊆ E that matches all A vertices to B vertices with the goal usually being to do this as fairly as possible. While the term semi-matching was coined in 2003 by Harvey et al. [WADS 2003], the problem had already previously been studied in the scheduling literature under different names.
更多查看译文
关键词
Bipartite Graph,Maximal Degree,Communication Complexity,Approximation Factor,Maximum Match
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要