Online Weighted Matching: Beating the $\frac{1}{2}$ Barrier
Post Doctoral Fellow, School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India
Maximum Matching in simple undirected graphs is a subset of maximum number of edges such that at most one edge is incident on any vertex. We study this problem in the semi-streaming model, in which...