1 paper
Paritosh Garg, Linus Jordan, Ola Svensson
While the basic greedy algorithm gives a semi-streaming algorithm with an approximation guarantee of 2 for the \emph{unweighted} matching problem, it was only recently that Paz a…