Approximating Maximum Matching Requires Almost Quadratic Time.

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein

Browse the full STOC paper archive.