Before revision:  [ FOCS ` 19] very recently led to a deterministic (1+\epsilon)f-approximation algorithm with O(f \log ( Cm )/\epsilon^2)  update time.
After revision:  [ FOCS ` 19] very recently led to a deterministic (1+\epsilon)f-approximation algorithm with O(f \log ( Cm )/\epsilon^2) amortized update time.